TMTP Model File: HEN013-1.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---SAT-4.0
% Problem : HEN013-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -t %d %s
% Computer : n186.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 11:10:40 EDT 2015
% Result : Satisfiable 0.03s
% Output : Saturation 0.03s
% Verified :
% Statistics : Number of clauses : 31 ( 31 expanded)
% Number of leaves : 31 ( 31 expanded)
% Depth : 0
% Number of atoms : 75 ( 75 expanded)
% Number of equality atoms : 11 ( 11 expanded)
% Maximal clause size : 6 ( 2 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(u19,axiom,
( quotient(zero,X1,zero) )).
cnf(u817,axiom,
( quotient(X1,X2,X0) )).
cnf(quotient_less_equal,axiom,
( quotient(X0,X1,zero)
| ~ less_equal(X0,X1) )).
cnf(u718,axiom,
( quotient(X0,X1,zero) )).
cnf(u352,axiom,
( quotient(X0,X0,zero) )).
cnf(u27,axiom,
( ~ quotient(zero,X6,X7)
| zero = X7 )).
cnf(u87,axiom,
( ~ quotient(zero,X20,X17)
| ~ quotient(X17,X18,X19)
| less_equal(X19,zero)
| ~ quotient(X21,X20,X18) )).
cnf(u208,axiom,
( ~ quotient(zero,X17,X14)
| ~ quotient(X14,zero,X15)
| less_equal(X15,zero) )).
cnf(u674,axiom,
( ~ quotient(X1,zero,X2)
| less_equal(X2,zero)
| ~ quotient(X0,zero,X1) )).
cnf(u402,axiom,
( ~ quotient(X14,X15,X12)
| ~ quotient(X11,X12,X13)
| ~ quotient(X14,X15,X11)
| less_equal(X13,zero) )).
cnf(u383,axiom,
( ~ quotient(X5,X7,X6)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X6,X3)
| ~ quotient(X7,X6,X4)
| less_equal(X2,zero) )).
cnf(u49,axiom,
( ~ quotient(X25,X24,X22)
| ~ quotient(X21,X22,X20)
| ~ quotient(X23,X24,X21)
| less_equal(X20,zero)
| ~ quotient(X23,X25,zero) )).
cnf(well_defined,axiom,
( ~ quotient(X0,X1,X2)
| ~ quotient(X0,X1,X8)
| X2 = X8 )).
cnf(quotient_property,axiom,
( ~ quotient(X3,X2,X7)
| less_equal(X6,X7)
| ~ quotient(X5,X4,X6)
| ~ quotient(X0,X2,X5)
| ~ quotient(X1,X2,X4)
| ~ quotient(X0,X1,X3) )).
cnf(divisor_existence,axiom,
( ~ quotient(X0,X1,X2)
| less_equal(X2,X0) )).
cnf(less_equal_quotient,axiom,
( ~ quotient(X0,X1,zero)
| less_equal(X0,X1) )).
cnf(u384,axiom,
( ~ quotient(X8,X8,X9)
| zero = X9 )).
cnf(zero_is_smallest,axiom,
( less_equal(zero,X0) )).
cnf(u818,axiom,
( less_equal(X1,X2) )).
cnf(u683,axiom,
( less_equal(X0,zero) )).
cnf(u381,axiom,
( less_equal(X0,X0) )).
cnf(u13,axiom,
( ~ less_equal(X0,zero)
| zero = X0 )).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X1,X0)
| ~ less_equal(X0,X1)
| X0 = X1 )).
cnf(u26,axiom,
( ~ less_equal(X3,X4)
| zero = X5
| ~ quotient(X3,X4,X5) )).
cnf(u47,axiom,
( ~ less_equal(X13,X11)
| ~ quotient(X8,X9,X7)
| ~ quotient(X10,X11,X8)
| ~ quotient(X12,X11,X9)
| ~ quotient(X10,X12,X13)
| less_equal(X7,zero) )).
cnf(u85,axiom,
( ~ less_equal(X9,X11)
| ~ quotient(X6,X7,X8)
| ~ quotient(X9,X10,X6)
| ~ quotient(X11,X10,X7)
| less_equal(X8,zero) )).
cnf(u794,axiom,
( X0 = X1 )).
cnf(u675,axiom,
( zero = identity )).
cnf(u717,axiom,
( zero = X1 )).
cnf(u326,axiom,
( zero = divide(X0,X0) )).
cnf(u17,axiom,
( zero = divide(zero,X0) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.03 % Problem : HEN013-1 : TPTP v6.2.0. Released v2.5.0.
% 0.01/0.04 % Command : vampire --mode casc_sat -t %d %s
% 0.02/1.07 % Computer : n186.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 11:24:57 CDT 2015
% 0.02/1.07 % CPUTime :
% 0.02/1.07 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.02/1.07 % remaining time: 3000 next slice time: 3
% 0.02/1.08 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.48 % (19202)Time limit reached!
% 0.03/1.48 % ------------------------------
% 0.03/1.48 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.03/1.48 % Termination reason: Time limit
% 0.03/1.48 % Termination phase: Saturation
% 0.03/1.48
% 0.03/1.48 % Active clauses: 114
% 0.03/1.48 % Passive clauses: 469
% 0.03/1.48 % Generated clauses: 1851
% 0.03/1.48 % Final active clauses: 98
% 0.03/1.48 % Final passive clauses: 293
% 0.03/1.48 % Input clauses: 9
% 0.03/1.48 % Initial clauses: 9
% 0.03/1.48 %
% 0.03/1.48 % Duplicate literals: 4
% 0.03/1.48 % Fw demodulations: 338
% 0.03/1.48 % Bw demodulations: 16
% 0.03/1.48 % Condensations: 9
% 0.03/1.48 % Global subsumptions: 64
% 0.03/1.48 %
% 0.03/1.48 % Simple tautologies: 9
% 0.03/1.48 % Equational tautologies: 53
% 0.03/1.48 % Forward subsumptions: 942
% 0.03/1.48 %
% 0.03/1.48 % Binary resolution: 679
% 0.03/1.48 % Forward superposition: 399
% 0.03/1.48 % Backward superposition: 323
% 0.03/1.48 % Self superposition: 9
% 0.03/1.48 %
% 0.03/1.48 % Split clauses: 1
% 0.03/1.48 % Split components: 2
% 0.03/1.48 % SAT solver clauses: 1198
% 0.03/1.48 % SAT solver unit clauses: 557
% 0.03/1.48 % SAT solver binary clauses: 332
% 0.03/1.48 % SAT solver learnt clauses: 274
% 0.03/1.48 % SAT solver learnt literals: 332
% 0.03/1.48 %
% 0.03/1.48 % Sat splits: 1
% 0.03/1.48 %
% 0.03/1.48 % TWLsolver clauses: 650
% 0.03/1.48 % TWLsolver calls for satisfiability: 7057
% 0.03/1.48 %
% 0.03/1.48 % Memory used [KB]: 1663
% 0.03/1.48 % Time elapsed: 0.400 s
% 0.03/1.48 % ------------------------------
% 0.03/1.48 ---- Runtime statistics ----
% 0.03/1.48 clauses created: 1853
% 0.03/1.48 clauses deleted: 1211
% 0.03/1.48 ssat_new_components: 2
% 0.03/1.48 ssat_sat_clauses: 1
% 0.03/1.48 total_frozen: 2
% 0.03/1.48 -----------------------------
% 0.03/1.48 % ------------------------------
% 0.03/1.48 % remaining time: 2995 next slice time: 10
% 0.03/1.48 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
% 0.03/1.50 Satisfiable!
% 0.03/1.50 % SZS status Satisfiable for theBenchmark
% 0.03/1.50 % # SZS output start Saturation.
% 0.03/1.50 cnf(u19,axiom,
% 0.03/1.50 quotient(zero,X1,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u817,axiom,
% 0.03/1.50 quotient(X1,X2,X0)).
% 0.03/1.50
% 0.03/1.50 cnf(quotient_less_equal,axiom,
% 0.03/1.50 quotient(X0,X1,zero) | ~less_equal(X0,X1)).
% 0.03/1.50
% 0.03/1.50 cnf(u718,axiom,
% 0.03/1.50 quotient(X0,X1,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u352,axiom,
% 0.03/1.50 quotient(X0,X0,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u27,axiom,
% 0.03/1.50 ~quotient(zero,X6,X7) | zero = X7).
% 0.03/1.50
% 0.03/1.50 cnf(u87,axiom,
% 0.03/1.50 ~quotient(zero,X20,X17) | ~quotient(X17,X18,X19) | less_equal(X19,zero) | ~quotient(X21,X20,X18)).
% 0.03/1.50
% 0.03/1.50 cnf(u208,axiom,
% 0.03/1.50 ~quotient(zero,X17,X14) | ~quotient(X14,zero,X15) | less_equal(X15,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u674,axiom,
% 0.03/1.50 ~quotient(X1,zero,X2) | less_equal(X2,zero) | ~quotient(X0,zero,X1)).
% 0.03/1.50
% 0.03/1.50 cnf(u402,axiom,
% 0.03/1.50 ~quotient(X14,X15,X12) | ~quotient(X11,X12,X13) | ~quotient(X14,X15,X11) | less_equal(X13,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u383,axiom,
% 0.03/1.50 ~quotient(X5,X7,X6) | ~quotient(X3,X4,X2) | ~quotient(X5,X6,X3) | ~quotient(X7,X6,X4) | less_equal(X2,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u49,axiom,
% 0.03/1.50 ~quotient(X25,X24,X22) | ~quotient(X21,X22,X20) | ~quotient(X23,X24,X21) | less_equal(X20,zero) | ~quotient(X23,X25,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(well_defined,axiom,
% 0.03/1.50 ~quotient(X0,X1,X2) | ~quotient(X0,X1,X8) | X2 = X8).
% 0.03/1.50
% 0.03/1.50 cnf(quotient_property,axiom,
% 0.03/1.50 ~quotient(X3,X2,X7) | less_equal(X6,X7) | ~quotient(X5,X4,X6) | ~quotient(X0,X2,X5) | ~quotient(X1,X2,X4) | ~quotient(X0,X1,X3)).
% 0.03/1.50
% 0.03/1.50 cnf(divisor_existence,axiom,
% 0.03/1.50 ~quotient(X0,X1,X2) | less_equal(X2,X0)).
% 0.03/1.50
% 0.03/1.50 cnf(less_equal_quotient,axiom,
% 0.03/1.50 ~quotient(X0,X1,zero) | less_equal(X0,X1)).
% 0.03/1.50
% 0.03/1.50 cnf(u384,axiom,
% 0.03/1.50 ~quotient(X8,X8,X9) | zero = X9).
% 0.03/1.50
% 0.03/1.50 cnf(zero_is_smallest,axiom,
% 0.03/1.50 less_equal(zero,X0)).
% 0.03/1.50
% 0.03/1.50 cnf(u818,axiom,
% 0.03/1.50 less_equal(X1,X2)).
% 0.03/1.50
% 0.03/1.50 cnf(u683,axiom,
% 0.03/1.50 less_equal(X0,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u381,axiom,
% 0.03/1.50 less_equal(X0,X0)).
% 0.03/1.50
% 0.03/1.50 cnf(u13,axiom,
% 0.03/1.50 ~less_equal(X0,zero) | zero = X0).
% 0.03/1.50
% 0.03/1.50 cnf(less_equal_and_equal,axiom,
% 0.03/1.50 ~less_equal(X1,X0) | ~less_equal(X0,X1) | X0 = X1).
% 0.03/1.50
% 0.03/1.50 cnf(u26,axiom,
% 0.03/1.50 ~less_equal(X3,X4) | zero = X5 | ~quotient(X3,X4,X5)).
% 0.03/1.50
% 0.03/1.50 cnf(u47,axiom,
% 0.03/1.50 ~less_equal(X13,X11) | ~quotient(X8,X9,X7) | ~quotient(X10,X11,X8) | ~quotient(X12,X11,X9) | ~quotient(X10,X12,X13) | less_equal(X7,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u85,axiom,
% 0.03/1.50 ~less_equal(X9,X11) | ~quotient(X6,X7,X8) | ~quotient(X9,X10,X6) | ~quotient(X11,X10,X7) | less_equal(X8,zero)).
% 0.03/1.50
% 0.03/1.50 cnf(u794,axiom,
% 0.03/1.50 X0 = X1).
% 0.03/1.50
% 0.03/1.50 cnf(u675,axiom,
% 0.03/1.50 zero = identity).
% 0.03/1.50
% 0.03/1.50 cnf(u717,axiom,
% 0.03/1.50 zero = X1).
% 0.03/1.50
% 0.03/1.50 cnf(u326,axiom,
% 0.03/1.50 zero = divide(X0,X0)).
% 0.03/1.50
% 0.03/1.50 cnf(u17,axiom,
% 0.03/1.50 zero = divide(zero,X0)).
% 0.03/1.50
% 0.03/1.50 % # SZS output end Saturation.
% 0.03/1.50 % ------------------------------
% 0.03/1.50 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.03/1.50 % Termination reason: Satisfiable
% 0.03/1.50
% 0.03/1.50 % Active clauses: 80
% 0.03/1.50 % Passive clauses: 133
% 0.03/1.50 % Extensionality clauses: 2
% 0.03/1.50 % Generated clauses: 894
% 0.03/1.50 % Final active clauses: 31
% 0.03/1.50 % Final extensionality clauses: 2
% 0.03/1.50 % Input clauses: 9
% 0.03/1.50 % Initial clauses: 9
% 0.03/1.50 %
% 0.03/1.50 % Fw demodulations: 173
% 0.03/1.50 % Bw demodulations: 100
% 0.03/1.50 % Global subsumptions: 3
% 0.03/1.50 %
% 0.03/1.50 % Simple tautologies: 1
% 0.03/1.50 % Equational tautologies: 39
% 0.03/1.50 % Forward subsumptions: 545
% 0.03/1.50 % Bw demodulations to eq. taut.: 1
% 0.03/1.50 %
% 0.03/1.50 % Binary resolution: 351
% 0.03/1.50 % Forward superposition: 99
% 0.03/1.50 % Backward superposition: 154
% 0.03/1.50 % Self superposition: 4
% 0.03/1.50 %
% 0.03/1.50 % Split clauses: 1
% 0.03/1.50 % Split components: 2
% 0.03/1.50 % SAT solver clauses: 142
% 0.03/1.50 % SAT solver unit clauses: 40
% 0.03/1.50 % SAT solver binary clauses: 47
% 0.03/1.50 % SAT solver learnt clauses: 3
% 0.03/1.50 % SAT solver learnt literals: 4
% 0.03/1.50 %
% 0.03/1.50 % Sat splits: 1
% 0.03/1.50 %
% 0.03/1.50 % TWLsolver clauses: 137
% 0.03/1.50 % TWLsolver calls for satisfiability: 1543
% 0.03/1.50 %
% 0.03/1.50 % Memory used [KB]: 895
% 0.03/1.50 % Time elapsed: 0.013 s
% 0.03/1.50 % ------------------------------
% 0.03/1.50 ---- Runtime statistics ----
% 0.03/1.50 clauses created: 897
% 0.03/1.50 clauses deleted: 542
% 0.03/1.50 ssat_new_components: 2
% 0.03/1.50 ssat_sat_clauses: 1
% 0.03/1.50 total_frozen: 74
% 0.03/1.50 -----------------------------
% 0.03/1.50 % ------------------------------
% 0.03/1.50 % Success in time 0.423 s
%------------------------------------------------------------------------------