TMTP Model File: LCL413-1.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---SAT-4.0
% Problem : LCL413-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -t %d %s
% Computer : n161.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:59:53 EDT 2015
% Result : Satisfiable 0.02s
% Output : Saturation 0.02s
% Verified :
% Statistics : Number of clauses : 18 ( 18 expanded)
% Number of leaves : 18 ( 18 expanded)
% Depth : 0
% Number of atoms : 25 ( 25 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 3 ( 1 average)
% Maximal term depth : 5 ( 3 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(u38,axiom,
( theorem(X1) )).
cnf(u29,axiom,
( theorem(or(or(X3,X4),not(X4))) )).
cnf(u27,axiom,
( theorem(or(X0,not(or(X0,X0)))) )).
cnf(u22,axiom,
( theorem(or(X1,X2))
| ~ theorem(X2) )).
cnf(u30,axiom,
( theorem(or(X5,X6))
| ~ theorem(X5) )).
cnf(u19,axiom,
( theorem(or(not(X0),or(X1,X0))) )).
cnf(u25,axiom,
( theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) )).
cnf(u20,axiom,
( theorem(or(not(or(X0,X1)),or(X1,X0))) )).
cnf(u18,axiom,
( theorem(or(not(or(X0,X0)),X0)) )).
cnf(u26,axiom,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) )).
cnf(u21,axiom,
( ~ theorem(or(X0,X0))
| theorem(X0) )).
cnf(u17,axiom,
( ~ theorem(or(not(X4),X3))
| theorem(X3)
| ~ theorem(X4) )).
cnf(u13,axiom,
( axiom(or(not(X0),or(X1,X0))) )).
cnf(u16,axiom,
( axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) )).
cnf(u15,axiom,
( axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) )).
cnf(u14,axiom,
( axiom(or(not(or(X0,X1)),or(X1,X0))) )).
cnf(u12,axiom,
( axiom(or(not(or(X0,X0)),X0)) )).
cnf(rule_1,axiom,
( ~ axiom(X3)
| theorem(X3) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL413-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 : n161.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 10:16:27 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.08 Satisfiable!
% 0.02/1.08 % SZS status Satisfiable for theBenchmark
% 0.02/1.08 % # SZS output start Saturation.
% 0.02/1.08 cnf(u38,axiom,
% 0.02/1.08 theorem(X1)).
% 0.02/1.08
% 0.02/1.08 cnf(u29,axiom,
% 0.02/1.08 theorem(or(or(X3,X4),not(X4)))).
% 0.02/1.08
% 0.02/1.08 cnf(u27,axiom,
% 0.02/1.08 theorem(or(X0,not(or(X0,X0))))).
% 0.02/1.08
% 0.02/1.08 cnf(u22,axiom,
% 0.02/1.08 theorem(or(X1,X2)) | ~theorem(X2)).
% 0.02/1.08
% 0.02/1.08 cnf(u30,axiom,
% 0.02/1.08 theorem(or(X5,X6)) | ~theorem(X5)).
% 0.02/1.08
% 0.02/1.08 cnf(u19,axiom,
% 0.02/1.08 theorem(or(not(X0),or(X1,X0)))).
% 0.02/1.08
% 0.02/1.08 cnf(u25,axiom,
% 0.02/1.08 theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2))))).
% 0.02/1.08
% 0.02/1.08 cnf(u20,axiom,
% 0.02/1.08 theorem(or(not(or(X0,X1)),or(X1,X0)))).
% 0.02/1.08
% 0.02/1.08 cnf(u18,axiom,
% 0.02/1.08 theorem(or(not(or(X0,X0)),X0))).
% 0.02/1.08
% 0.02/1.08 cnf(u26,axiom,
% 0.02/1.08 ~theorem(or(X1,X0)) | theorem(or(X0,X1))).
% 0.02/1.08
% 0.02/1.08 cnf(u21,axiom,
% 0.02/1.08 ~theorem(or(X0,X0)) | theorem(X0)).
% 0.02/1.08
% 0.02/1.08 cnf(u17,axiom,
% 0.02/1.08 ~theorem(or(not(X4),X3)) | theorem(X3) | ~theorem(X4)).
% 0.02/1.08
% 0.02/1.08 cnf(u13,axiom,
% 0.02/1.08 axiom(or(not(X0),or(X1,X0)))).
% 0.02/1.08
% 0.02/1.08 cnf(u16,axiom,
% 0.02/1.08 axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1))))).
% 0.02/1.08
% 0.02/1.08 cnf(u15,axiom,
% 0.02/1.08 axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2))))).
% 0.02/1.08
% 0.02/1.08 cnf(u14,axiom,
% 0.02/1.08 axiom(or(not(or(X0,X1)),or(X1,X0)))).
% 0.02/1.08
% 0.02/1.08 cnf(u12,axiom,
% 0.02/1.08 axiom(or(not(or(X0,X0)),X0))).
% 0.02/1.08
% 0.02/1.08 cnf(rule_1,axiom,
% 0.02/1.08 ~axiom(X3) | theorem(X3)).
% 0.02/1.08
% 0.02/1.08 % # SZS output end Saturation.
% 0.02/1.08 % ------------------------------
% 0.02/1.08 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.02/1.08 % Termination reason: Satisfiable
% 0.02/1.08
% 0.02/1.08 % Active clauses: 18
% 0.02/1.08 % Passive clauses: 24
% 0.02/1.08 % Generated clauses: 33
% 0.02/1.09 % Final active clauses: 18
% 0.02/1.09 % Input clauses: 10
% 0.02/1.09 % Initial clauses: 7
% 0.02/1.09 %
% 0.02/1.09 % Function definitions: 3
% 0.02/1.09 %
% 0.02/1.09 % Simple tautologies: 3
% 0.02/1.09 % Forward subsumptions: 11
% 0.02/1.09 %
% 0.02/1.09 % Binary resolution: 25
% 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: 56
% 0.02/1.09 % SAT solver unit clauses: 33
% 0.02/1.09 % SAT solver binary clauses: 15
% 0.02/1.09 % SAT solver learnt clauses: 6
% 0.02/1.09 % SAT solver learnt literals: 2
% 0.02/1.09 %
% 0.02/1.09 % Sat splits: 1
% 0.02/1.09 %
% 0.02/1.09 % TWLsolver clauses: 44
% 0.02/1.09 % TWLsolver calls for satisfiability: 171
% 0.02/1.09 %
% 0.02/1.09 % Memory used [KB]: 511
% 0.02/1.09 % Time elapsed: 0.002 s
% 0.02/1.09 % ------------------------------
% 0.02/1.09 ---- Runtime statistics ----
% 0.02/1.09 clauses created: 44
% 0.02/1.09 clauses deleted: 6
% 0.02/1.09 ssat_new_components: 2
% 0.02/1.09 ssat_sat_clauses: 1
% 0.02/1.09 total_frozen: 5
% 0.02/1.09 -----------------------------
% 0.02/1.09 % ------------------------------
% 0.02/1.09 % Success in time 0.01 s
%------------------------------------------------------------------------------