TMTP Model File: ANA006-1.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---SAT-4.0
% Problem : ANA006-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -t %d %s
% Computer : n128.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-504.23.4.el6.x86_64
% CPULimit : 300s
% DateTime : Wed Jul 8 09:58:01 EDT 2015
% Result : Satisfiable 21.11s
% Output : Saturation 21.11s
% Verified :
% Statistics : Number of clauses : 22 ( 22 expanded)
% Number of leaves : 22 ( 22 expanded)
% Depth : 0
% Number of atoms : 47 ( 47 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 4 ( 2 average)
% Maximal term depth : 3 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(reflexivity_of_less_than,axiom,
( ~ less_than(X0,X0) )).
cnf(u41,axiom,
( sQ0_eqProxy(X0,X0) )).
cnf(u30,axiom,
( sQ0_eqProxy(add(X0,n0),X0) )).
cnf(u31,axiom,
( sQ0_eqProxy(add(n0,X0),X0) )).
cnf(u42,axiom,
( sQ0_eqProxy(X1,X0)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(axiom_6_2,axiom,
( ~ less_than(n0,X3)
| less_than(n0,half(X3)) )).
cnf(u32,axiom,
( sQ0_eqProxy(add(X0,X1),add(X1,X0)) )).
cnf(u37,axiom,
( sQ0_eqProxy(half(X0),half(X1))
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u38,axiom,
( sQ0_eqProxy(absolute(X0),absolute(X1))
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u39,axiom,
( sQ0_eqProxy(minus(X0),minus(X1))
| ~ sQ0_eqProxy(X0,X1) )).
cnf(transitivity_of_less_than,axiom,
( ~ less_than(X1,X2)
| ~ less_than(X0,X1)
| less_than(X0,X2) )).
cnf(u43,axiom,
( sQ0_eqProxy(X0,X2)
| ~ sQ0_eqProxy(X1,X2)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u33,axiom,
( sQ0_eqProxy(add(minus(X0),minus(X1)),minus(add(X0,X1))) )).
cnf(axiom_2_1,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X0)
| less_than(n0,minimum(X0,X1)) )).
cnf(axiom_2_2,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X0)
| less_than(minimum(X0,X1),X0) )).
cnf(axiom_2_3,axiom,
( ~ less_than(n0,X1)
| ~ less_than(n0,X0)
| less_than(minimum(X0,X1),X1) )).
cnf(u34,axiom,
( sQ0_eqProxy(add(X0,add(X1,X2)),add(add(X0,X1),X2)) )).
cnf(u40,axiom,
( ~ less_than(X0,X2)
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1)
| less_than(X1,X3) )).
cnf(axiom_3,axiom,
( ~ less_than(X1,half(X3))
| ~ less_than(X0,half(X3))
| less_than(add(X0,X1),X3) )).
cnf(c_17,axiom,
( ~ less_than(add(absolute(X0),absolute(X1)),X3)
| less_than(absolute(add(X0,X1)),X3) )).
cnf(u35,axiom,
( sQ0_eqProxy(add(X0,X2),add(X1,X3))
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u36,axiom,
( sQ0_eqProxy(minimum(X0,X2),minimum(X1,X3))
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA006-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.04 % Command : vampire --mode casc_sat -t %d %s
% 0.02/1.07 % Computer : n128.star.cs.uiowa.edu
% 0.02/1.07 % Model : x86_64 x86_64
% 0.02/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.07 % Memory : 32286.75MB
% 0.02/1.07 % OS : Linux 2.6.32-504.23.4.el6.x86_64
% 0.02/1.07 % CPULimit : 300
% 0.02/1.07 % DateTime : Tue Jul 7 13:09:52 CDT 2015
% 0.02/1.07 % CPUTime :
% 0.02/1.08 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.02/1.08 % remaining time: 3000 next slice time: 3
% 0.02/1.09 dis+10_3_cond=fast:fsr=off:gs=on:gsaa=full_model:gsssp=full:nwc=1:sac=on:sdd=large:sser=off:sfr=on:ssfp=10000:ssfq=1.2:ssnc=none:sp=occurrence_1 on theBenchmark
% 0.03/1.49 % (46218)Time limit reached!
% 0.03/1.49 % ------------------------------
% 0.03/1.49 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.03/1.49 % Termination reason: Time limit
% 0.03/1.49 % Termination phase: Saturation
% 0.03/1.49
% 0.03/1.49 % Active clauses: 67
% 0.03/1.49 % Passive clauses: 2548
% 0.03/1.49 % Generated clauses: 5855
% 0.03/1.49 % Final active clauses: 67
% 0.03/1.49 % Final passive clauses: 2397
% 0.03/1.49 % Input clauses: 14
% 0.03/1.49 % Initial clauses: 14
% 0.03/1.49 %
% 0.03/1.49 % Duplicate literals: 19
% 0.03/1.49 % Fw demodulations: 2259
% 0.03/1.49 % Condensations: 5
% 0.03/1.49 % Global subsumptions: 5
% 0.03/1.49 %
% 0.03/1.49 % Simple tautologies: 3
% 0.03/1.49 % Forward subsumptions: 851
% 0.03/1.49 % Fw demodulations to eq. taut.: 172
% 0.03/1.49 %
% 0.03/1.49 % Binary resolution: 96
% 0.03/1.49 % Forward superposition: 1929
% 0.03/1.49 % Backward superposition: 1480
% 0.03/1.49 % Self superposition: 54
% 0.03/1.49 %
% 0.03/1.49 % SAT solver clauses: 2645
% 0.03/1.49 % SAT solver unit clauses: 2166
% 0.03/1.49 % SAT solver binary clauses: 95
% 0.03/1.49 % SAT solver learnt clauses: 15
% 0.03/1.49 % SAT solver learnt literals: 47
% 0.03/1.49 %
% 0.03/1.49 % TWLsolver clauses: 2620
% 0.03/1.49 % TWLsolver calls for satisfiability: 8975
% 0.03/1.49 %
% 0.03/1.49 % Memory used [KB]: 6780
% 0.03/1.49 % Time elapsed: 0.400 s
% 0.03/1.49 % ------------------------------
% 0.03/1.49 ---- Runtime statistics ----
% 0.03/1.49 clauses created: 5855
% 0.03/1.49 clauses deleted: 1467
% 0.03/1.49 -----------------------------
% 0.03/1.49 % ------------------------------
% 0.03/1.49 % remaining time: 2995 next slice time: 10
% 0.03/1.49 ott+11_5_cond=on:er=filter:fsr=off:gs=on:gsaa=from_current:gsem=off:nwc=1:sac=on:sfr=on:ssfp=1000:ssfq=1.0:smm=sco:ssnc=none:updr=off_9 on theBenchmark
% 1.42/2.59 % (46220)Time limit reached!
% 1.42/2.59 % ------------------------------
% 1.42/2.59 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 1.42/2.59 % Termination reason: Time limit
% 1.42/2.59 % Termination phase: Saturation
% 1.42/2.59
% 1.42/2.59 % Active clauses: 83
% 1.42/2.59 % Passive clauses: 1386
% 1.42/2.59 % Generated clauses: 16929
% 1.42/2.59 % Final active clauses: 83
% 1.42/2.59 % Final passive clauses: 1303
% 1.42/2.59 % Input clauses: 14
% 1.42/2.59 % Initial clauses: 14
% 1.42/2.59 %
% 1.42/2.59 % Duplicate literals: 1
% 1.42/2.59 % Fw demodulations: 8097
% 1.42/2.59 %
% 1.42/2.59 % Simple tautologies: 1
% 1.42/2.59 % Forward subsumptions: 6635
% 1.42/2.59 % Fw demodulations to eq. taut.: 444
% 1.42/2.59 %
% 1.42/2.59 % Binary resolution: 19
% 1.42/2.59 % Forward superposition: 4718
% 1.42/2.59 % Backward superposition: 3963
% 1.42/2.59 % Self superposition: 117
% 1.42/2.59 %
% 1.42/2.59 % SAT solver clauses: 1386
% 1.42/2.59 % SAT solver unit clauses: 1360
% 1.42/2.59 % SAT solver binary clauses: 3
% 1.42/2.59 %
% 1.42/2.59 % TWLsolver clauses: 1386
% 1.42/2.59 % TWLsolver calls for satisfiability: 1838
% 1.42/2.59 %
% 1.42/2.59 % Memory used [KB]: 55521
% 1.42/2.59 % Time elapsed: 1.100 s
% 1.42/2.59 % ------------------------------
% 1.42/2.59 ---- Runtime statistics ----
% 1.42/2.59 clauses created: 16929
% 1.42/2.59 clauses deleted: 14008
% 1.42/2.59 -----------------------------
% 1.42/2.59 % ------------------------------
% 1.42/2.59 % remaining time: 2984 next slice time: 194
% 1.42/2.59 dis+11_7_184 on theBenchmark
% 21.02/22.09 % (46221)Time limit reached!
% 21.02/22.09 % ------------------------------
% 21.02/22.09 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 21.02/22.09 % Termination reason: Time limit
% 21.02/22.09 % Termination phase: Saturation
% 21.02/22.09
% 21.02/22.09 % Active clauses: 165
% 21.02/22.09 % Passive clauses: 61627
% 21.02/22.09 % Generated clauses: 154182
% 21.02/22.09 % Final active clauses: 165
% 21.02/22.09 % Final passive clauses: 59993
% 21.02/22.09 % Input clauses: 14
% 21.02/22.09 % Initial clauses: 14
% 21.02/22.09 %
% 21.02/22.09 % Duplicate literals: 1
% 21.02/22.09 % Fw demodulations: 82684
% 21.02/22.09 %
% 21.02/22.09 % Simple tautologies: 1
% 21.02/22.09 % Forward subsumptions: 10049
% 21.02/22.09 % Fw demodulations to eq. taut.: 1142
% 21.02/22.09 %
% 21.02/22.09 % Binary resolution: 31
% 21.02/22.09 % Forward superposition: 38670
% 21.02/22.09 % Backward superposition: 32291
% 21.02/22.09 % Self superposition: 491
% 21.02/22.09 %
% 21.02/22.09 % Memory used [KB]: 548306
% 21.02/22.09 % Time elapsed: 19.500 s
% 21.02/22.09 % ------------------------------
% 21.02/22.09 ---- Runtime statistics ----
% 21.02/22.09 clauses created: 154182
% 21.02/22.09 clauses deleted: 17237
% 21.02/22.09 -----------------------------
% 21.02/22.09 % ------------------------------
% 21.11/22.12 % remaining time: 2789 next slice time: 50
% 21.11/22.13 ins+10_1_cond=on:fde=none:gs=on:gsem=on:igbrr=0.8:igpr=on:igrr=2/1:igs=1004:igwr=on:nwc=1:sas=minisat:sos=on:spl=off:updr=off:dm=on_47 on theBenchmark
% 21.11/22.13 % SZS status Satisfiable for theBenchmark
% 21.11/22.13 Satisfiable!
% 21.11/22.13 % # SZS output start Saturation.
% 21.11/22.13 cnf(reflexivity_of_less_than,axiom,
% 21.11/22.13 ~less_than(X0,X0)).
% 21.11/22.13
% 21.11/22.13 cnf(u41,axiom,
% 21.11/22.13 sQ0_eqProxy(X0,X0)).
% 21.11/22.13
% 21.11/22.13 cnf(u30,axiom,
% 21.11/22.13 sQ0_eqProxy(add(X0,n0),X0)).
% 21.11/22.13
% 21.11/22.13 cnf(u31,axiom,
% 21.11/22.13 sQ0_eqProxy(add(n0,X0),X0)).
% 21.11/22.13
% 21.11/22.13 cnf(u42,axiom,
% 21.11/22.13 sQ0_eqProxy(X1,X0) | ~sQ0_eqProxy(X0,X1)).
% 21.11/22.13
% 21.11/22.13 cnf(axiom_6_2,axiom,
% 21.11/22.13 ~less_than(n0,X3) | less_than(n0,half(X3))).
% 21.11/22.13
% 21.11/22.13 cnf(u32,axiom,
% 21.11/22.13 sQ0_eqProxy(add(X0,X1),add(X1,X0))).
% 21.11/22.13
% 21.11/22.13 cnf(u37,axiom,
% 21.11/22.13 sQ0_eqProxy(half(X0),half(X1)) | ~sQ0_eqProxy(X0,X1)).
% 21.11/22.13
% 21.11/22.13 cnf(u38,axiom,
% 21.11/22.13 sQ0_eqProxy(absolute(X0),absolute(X1)) | ~sQ0_eqProxy(X0,X1)).
% 21.11/22.13
% 21.11/22.13 cnf(u39,axiom,
% 21.11/22.13 sQ0_eqProxy(minus(X0),minus(X1)) | ~sQ0_eqProxy(X0,X1)).
% 21.11/22.13
% 21.11/22.13 cnf(transitivity_of_less_than,axiom,
% 21.11/22.13 ~less_than(X1,X2) | ~less_than(X0,X1) | less_than(X0,X2)).
% 21.11/22.13
% 21.11/22.13 cnf(u43,axiom,
% 21.11/22.13 sQ0_eqProxy(X0,X2) | ~sQ0_eqProxy(X1,X2) | ~sQ0_eqProxy(X0,X1)).
% 21.11/22.13
% 21.11/22.13 cnf(u33,axiom,
% 21.11/22.13 sQ0_eqProxy(add(minus(X0),minus(X1)),minus(add(X0,X1)))).
% 21.11/22.13
% 21.11/22.13 cnf(axiom_2_1,axiom,
% 21.11/22.13 ~less_than(n0,X1) | ~less_than(n0,X0) | less_than(n0,minimum(X0,X1))).
% 21.11/22.13
% 21.11/22.13 cnf(axiom_2_2,axiom,
% 21.11/22.13 ~less_than(n0,X1) | ~less_than(n0,X0) | less_than(minimum(X0,X1),X0)).
% 21.11/22.13
% 21.11/22.13 cnf(axiom_2_3,axiom,
% 21.11/22.13 ~less_than(n0,X1) | ~less_than(n0,X0) | less_than(minimum(X0,X1),X1)).
% 21.11/22.13
% 21.11/22.13 cnf(u34,axiom,
% 21.11/22.13 sQ0_eqProxy(add(X0,add(X1,X2)),add(add(X0,X1),X2))).
% 21.11/22.13
% 21.11/22.13 cnf(u40,axiom,
% 21.11/22.13 ~less_than(X0,X2) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1) | less_than(X1,X3)).
% 21.11/22.13
% 21.11/22.13 cnf(axiom_3,axiom,
% 21.11/22.13 ~less_than(X1,half(X3)) | ~less_than(X0,half(X3)) | less_than(add(X0,X1),X3)).
% 21.11/22.13
% 21.11/22.13 cnf(c_17,axiom,
% 21.11/22.13 ~less_than(add(absolute(X0),absolute(X1)),X3) | less_than(absolute(add(X0,X1)),X3)).
% 21.11/22.13
% 21.11/22.13 cnf(u35,axiom,
% 21.11/22.13 sQ0_eqProxy(add(X0,X2),add(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 21.11/22.13
% 21.11/22.13 cnf(u36,axiom,
% 21.11/22.13 sQ0_eqProxy(minimum(X0,X2),minimum(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 21.11/22.13
% 21.11/22.13 % # SZS output end Saturation.
% 21.11/22.13 % ------------------------------
% 21.11/22.13 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 21.11/22.13 % Termination reason: Satisfiable
% 21.11/22.13
% 21.11/22.13 % Active clauses: 14
% 21.11/22.13 % Input clauses: 14
% 21.11/22.13 % Initial clauses: 14
% 21.11/22.13 %
% 21.11/22.13 % SAT solver clauses: 120
% 21.11/22.13 % SAT solver unit clauses: 34
% 21.11/22.13 % SAT solver binary clauses: 43
% 21.11/22.13 %
% 21.11/22.13 % InstGen redundant clauses: 1
% 21.11/22.13 % InstGen kept clauses: 44
% 21.11/22.13 % InstGen iterations: 3
% 21.11/22.13 %
% 21.11/22.13 % Memory used [KB]: 767
% 21.11/22.13 % Time elapsed: 0.003 s
% 21.11/22.13 % ------------------------------
% 21.11/22.13 ---- Runtime statistics ----
% 21.11/22.13 clauses created: 42
% 21.11/22.13 -----------------------------
% 21.11/22.13 % ------------------------------
% 21.11/22.13 % Success in time 21.049 s
%------------------------------------------------------------------------------