TMTP Model File: HEN013-2.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---SAT-4.0
% Problem : HEN013-2 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -t %d %s
% Computer : n144.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:41 EDT 2015
% Result : Satisfiable 0.02s
% Output : Saturation 0.02s
% Verified :
% Statistics : Number of clauses : 11 ( 11 expanded)
% Number of leaves : 11 ( 11 expanded)
% Depth : 0
% Number of atoms : 14 ( 14 expanded)
% Number of equality atoms : 7 ( 7 expanded)
% Maximal clause size : 3 ( 1 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(zero_is_smallest,axiom,
( less_equal(zero,X0) )).
cnf(u776,axiom,
( less_equal(X0,X1) )).
cnf(u740,axiom,
( less_equal(X0,zero) )).
cnf(u164,axiom,
( less_equal(X0,X0) )).
cnf(u23,axiom,
( ~ less_equal(X0,zero)
| zero = X0 )).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X1,X0)
| ~ less_equal(X0,X1)
| X0 = X1 )).
cnf(u786,axiom,
( X0 = X1 )).
cnf(u748,axiom,
( zero = X1 )).
cnf(u735,axiom,
( zero = identity )).
cnf(u141,axiom,
( divide(X0,X0) = zero )).
cnf(u8,axiom,
( divide(zero,X0) = zero )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN013-2 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : vampire --mode casc_sat -t %d %s
% 0.02/1.07 % Computer : n144.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.02/1.09 Satisfiable!
% 0.02/1.09 % SZS status Satisfiable for theBenchmark
% 0.02/1.09 % # SZS output start Saturation.
% 0.02/1.09 cnf(zero_is_smallest,axiom,
% 0.02/1.09 less_equal(zero,X0)).
% 0.02/1.09
% 0.02/1.09 cnf(u776,axiom,
% 0.02/1.09 less_equal(X0,X1)).
% 0.02/1.09
% 0.02/1.09 cnf(u740,axiom,
% 0.02/1.09 less_equal(X0,zero)).
% 0.02/1.09
% 0.02/1.09 cnf(u164,axiom,
% 0.02/1.09 less_equal(X0,X0)).
% 0.02/1.09
% 0.02/1.09 cnf(u23,axiom,
% 0.02/1.09 ~less_equal(X0,zero) | zero = X0).
% 0.02/1.09
% 0.02/1.09 cnf(less_equal_and_equal,axiom,
% 0.02/1.09 ~less_equal(X1,X0) | ~less_equal(X0,X1) | X0 = X1).
% 0.02/1.09
% 0.02/1.09 cnf(u786,axiom,
% 0.02/1.09 X0 = X1).
% 0.02/1.09
% 0.02/1.09 cnf(u748,axiom,
% 0.02/1.09 zero = X1).
% 0.02/1.09
% 0.02/1.09 cnf(u735,axiom,
% 0.02/1.09 zero = identity).
% 0.02/1.09
% 0.02/1.09 cnf(u141,axiom,
% 0.02/1.09 divide(X0,X0) = zero).
% 0.02/1.09
% 0.02/1.09 cnf(u8,axiom,
% 0.02/1.09 divide(zero,X0) = zero).
% 0.02/1.09
% 0.02/1.09 % # SZS output end Saturation.
% 0.02/1.09 % ------------------------------
% 0.02/1.09 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.02/1.09 % Termination reason: Satisfiable
% 0.02/1.09
% 0.02/1.09 % Active clauses: 40
% 0.02/1.09 % Passive clauses: 150
% 0.02/1.09 % Generated clauses: 799
% 0.02/1.09 % Final active clauses: 11
% 0.02/1.09 % Input clauses: 7
% 0.02/1.09 % Initial clauses: 7
% 0.02/1.09 %
% 0.02/1.09 % Trivial inequalities: 11
% 0.02/1.09 % Fw demodulations: 313
% 0.02/1.09 % Bw demodulations: 28
% 0.02/1.09 % Global subsumptions: 11
% 0.02/1.09 %
% 0.02/1.09 % Equational tautologies: 5
% 0.02/1.09 % Forward subsumptions: 418
% 0.02/1.09 % Bw demodulations to eq. taut.: 1
% 0.02/1.09 %
% 0.02/1.09 % Binary resolution: 56
% 0.02/1.09 % Forward superposition: 175
% 0.02/1.09 % Backward superposition: 187
% 0.02/1.09 % Self superposition: 10
% 0.02/1.09 %
% 0.02/1.09 % Split clauses: 1
% 0.02/1.09 % Split components: 2
% 0.02/1.09 % SAT solver clauses: 247
% 0.02/1.09 % SAT solver unit clauses: 156
% 0.02/1.09 % SAT solver binary clauses: 71
% 0.02/1.09 % SAT solver learnt clauses: 22
% 0.02/1.09 % SAT solver learnt literals: 8
% 0.02/1.09 %
% 0.02/1.09 % Sat splits: 1
% 0.02/1.09 %
% 0.02/1.09 % TWLsolver clauses: 203
% 0.02/1.09 % TWLsolver calls for satisfiability: 540
% 0.02/1.09 %
% 0.02/1.09 % Memory used [KB]: 895
% 0.02/1.09 % Time elapsed: 0.011 s
% 0.02/1.09 % ------------------------------
% 0.02/1.09 ---- Runtime statistics ----
% 0.02/1.09 clauses created: 802
% 0.02/1.09 clauses deleted: 528
% 0.02/1.09 ssat_new_components: 2
% 0.02/1.09 ssat_sat_clauses: 1
% 0.02/1.09 total_frozen: 102
% 0.02/1.09 -----------------------------
% 0.02/1.09 % ------------------------------
% 0.02/1.09 % Success in time 0.02 s
%------------------------------------------------------------------------------