TMTP Model File: LCL413-1.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : LCL413-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n187.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:55:22 EDT 2015
% Result : Satisfiable 13.70s
% Output : Saturation 13.70s
% Verified :
% Statistics : Number of clauses : 95 ( 95 expanded)
% Number of leaves : 95 ( 95 expanded)
% Depth : 0
% Number of atoms : 117 ( 117 expanded)
% Number of equality atoms : 1 ( 1 expanded)
% Maximal clause size : 3 ( 1 average)
% Maximal term depth : 5 ( 3 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---4.0 format not known, defaulting to TPTP
cnf(u470,axiom,
( theorem(not(not(or(X0,not(X0))))) )).
cnf(u490,axiom,
( theorem(not(not(X0)))
| ~ theorem(X0) )).
cnf(u457,axiom,
( theorem(not(not(implies(X0,X0)))) )).
cnf(u2674,axiom,
( theorem(implies(not(X0),implies(X0,X1))) )).
cnf(u528,axiom,
( theorem(implies(not(X0),X1))
| ~ theorem(X0) )).
cnf(u492,axiom,
( theorem(implies(not(implies(X0,X0)),X1)) )).
cnf(u217,axiom,
( theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))) )).
cnf(u62,axiom,
( theorem(implies(implies(X0,X1),or(X1,not(X0)))) )).
cnf(u441,axiom,
( theorem(implies(implies(X0,or(X1,X1)),implies(X0,X1))) )).
cnf(u444,axiom,
( theorem(implies(implies(X0,X1),implies(X0,or(X2,X1)))) )).
cnf(u52,axiom,
( theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) )).
cnf(u14,axiom,
( theorem(implies(implies(X0,not(X0)),not(X0))) )).
cnf(u216,axiom,
( theorem(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1)))) )).
cnf(u63,axiom,
( theorem(implies(or(X1,not(X0)),implies(X0,X1))) )).
cnf(u82,axiom,
( theorem(implies(or(X12,X10),or(X12,X11)))
| ~ theorem(implies(X10,X11)) )).
cnf(u75,axiom,
( theorem(implies(or(X0,X1),or(X0,or(X2,X1)))) )).
cnf(u74,axiom,
( theorem(implies(or(X0,or(X1,X2)),or(X0,or(X2,X1)))) )).
cnf(u73,axiom,
( theorem(implies(or(X0,or(X1,X1)),or(X0,X1))) )).
cnf(u221,axiom,
( theorem(implies(or(X0,X0),or(X1,X0))) )).
cnf(u31,axiom,
( theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) )).
cnf(u13,axiom,
( theorem(implies(or(X0,X1),or(X1,X0))) )).
cnf(u11,axiom,
( theorem(implies(or(X0,X0),X0)) )).
cnf(u138,axiom,
( theorem(implies(X0,not(implies(X0,not(X0))))) )).
cnf(u352,axiom,
( theorem(implies(X0,not(not(X0)))) )).
cnf(u2503,axiom,
( theorem(implies(X0,implies(not(X0),X1))) )).
cnf(u70,axiom,
( theorem(implies(X0,implies(or(X1,X2),or(X2,X1)))) )).
cnf(u69,axiom,
( theorem(implies(X0,implies(or(X1,X1),X1))) )).
cnf(u26,axiom,
( theorem(implies(X0,implies(X1,implies(X2,X1)))) )).
cnf(u71,axiom,
( theorem(implies(X0,implies(X1,or(X2,X1)))) )).
cnf(u307,axiom,
( theorem(implies(X0,implies(X1,X1))) )).
cnf(u18,axiom,
( theorem(implies(X7,implies(X6,X7))) )).
cnf(u2494,axiom,
( theorem(implies(X0,or(X0,X1))) )).
cnf(u342,axiom,
( theorem(implies(X0,or(X1,not(X1)))) )).
cnf(u296,axiom,
( theorem(implies(X0,or(X1,implies(X2,X2)))) )).
cnf(u222,axiom,
( theorem(implies(X0,or(X1,or(X2,X0)))) )).
cnf(u224,axiom,
( theorem(implies(X1,or(X0,X2)))
| ~ theorem(or(X0,implies(X1,X2))) )).
cnf(u12,axiom,
( theorem(implies(X0,or(X1,X0))) )).
cnf(u29,axiom,
( theorem(implies(X3,X4))
| ~ theorem(X4) )).
cnf(u289,axiom,
( theorem(implies(X0,X0)) )).
cnf(u97,axiom,
( theorem(or(implies(or(X0,X0),X0),X1)) )).
cnf(u133,axiom,
( theorem(or(implies(X0,X1),not(X1))) )).
cnf(u111,axiom,
( theorem(or(implies(X0,or(X1,X0)),X2)) )).
cnf(u688,axiom,
( theorem(or(implies(X0,not(X1)),X1)) )).
cnf(u290,axiom,
( theorem(or(implies(X0,X0),X1)) )).
cnf(u2458,axiom,
( theorem(or(implies(X0,X1),X0)) )).
cnf(u666,axiom,
( theorem(or(or(X0,not(X1)),X1)) )).
cnf(u338,axiom,
( theorem(or(or(X0,not(X0)),X1)) )).
cnf(u2578,axiom,
( theorem(or(or(X0,X1),not(X0))) )).
cnf(u131,axiom,
( theorem(or(or(X0,X1),not(or(X1,X0)))) )).
cnf(u132,axiom,
( theorem(or(or(X0,X1),not(X1))) )).
cnf(u136,axiom,
( theorem(or(X1,not(X0)))
| ~ theorem(implies(X0,X1)) )).
cnf(u325,axiom,
( theorem(or(X0,not(X0))) )).
cnf(u130,axiom,
( theorem(or(X0,not(or(X0,X0)))) )).
cnf(u2454,axiom,
( theorem(or(X0,implies(X0,X1))) )).
cnf(u608,axiom,
( theorem(or(X0,implies(X1,not(X0)))) )).
cnf(u23,axiom,
( theorem(or(X0,implies(X1,implies(X2,X1)))) )).
cnf(u22,axiom,
( theorem(or(X0,implies(X1,or(X2,X1)))) )).
cnf(u282,axiom,
( theorem(or(X0,implies(X1,X1))) )).
cnf(u280,axiom,
( theorem(or(X0,implies(or(X1,or(X0,X2)),or(X1,X2)))) )).
cnf(u59,axiom,
( theorem(or(X0,implies(or(X1,X2),or(X2,X1)))) )).
cnf(u279,axiom,
( theorem(or(X0,implies(or(X1,X0),X1))) )).
cnf(u21,axiom,
( theorem(or(X0,implies(or(X1,X1),X1))) )).
cnf(u295,axiom,
( theorem(or(X0,or(X1,implies(X2,X2)))) )).
cnf(u560,axiom,
( theorem(or(X0,or(X1,not(X0)))) )).
cnf(u341,axiom,
( theorem(or(X0,or(X1,not(X1)))) )).
cnf(u28,axiom,
( theorem(or(X1,X2))
| ~ theorem(X2) )).
cnf(u125,axiom,
( theorem(or(X0,X1))
| ~ theorem(X0) )).
cnf(rule_1,axiom,
( theorem(X3)
| ~ axiom(X3) )).
cnf(u772,axiom,
( theorem(X0) )).
cnf(u148,axiom,
( ~ theorem(not(X0))
| theorem(implies(X0,X1)) )).
cnf(u85,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) )).
cnf(u79,axiom,
( ~ theorem(or(X3,or(X4,X5)))
| theorem(or(X4,or(X3,X5))) )).
cnf(u61,axiom,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) )).
cnf(u27,axiom,
( ~ theorem(or(X0,X0))
| theorem(X0) )).
cnf(u83,axiom,
( ~ theorem(implies(X13,not(X13)))
| theorem(not(X13)) )).
cnf(rule_2,axiom,
( ~ theorem(implies(X4,X3))
| theorem(X3)
| ~ theorem(X4) )).
cnf(u37,axiom,
( axiom(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))) )).
cnf(u17,axiom,
( axiom(implies(implies(X4,X5),or(X5,not(X4)))) )).
cnf(u15,axiom,
( axiom(implies(implies(X1,not(X1)),not(X1))) )).
cnf(u227,axiom,
( axiom(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))) )).
cnf(u86,axiom,
( axiom(implies(implies(X0,not(X1)),implies(X1,not(X0)))) )).
cnf(u55,axiom,
( axiom(implies(implies(X1,X2),implies(implies(X0,X1),implies(X0,X2)))) )).
cnf(axiom_1_6,axiom,
( axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) )).
cnf(u19,axiom,
( axiom(implies(X9,implies(X8,X9))) )).
cnf(axiom_1_3,axiom,
( axiom(implies(X0,or(X1,X0))) )).
cnf(u36,axiom,
( axiom(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1)))) )).
cnf(u16,axiom,
( axiom(implies(or(X3,not(X2)),implies(X2,X3))) )).
cnf(axiom_1_5,axiom,
( axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) )).
cnf(axiom_1_4,axiom,
( axiom(implies(or(X0,X1),or(X1,X0))) )).
cnf(axiom_1_2,axiom,
( axiom(implies(or(X0,X0),X0)) )).
cnf(u220,axiom,
( ~ axiom(not(X0))
| theorem(implies(X0,X1)) )).
cnf(u30,axiom,
( ~ axiom(implies(X6,X5))
| ~ theorem(X6)
| theorem(X5) )).
cnf(u128,axiom,
( ~ axiom(or(X8,X7))
| theorem(or(X7,X8)) )).
cnf(u40,axiom,
( ~ axiom(or(X0,X0))
| theorem(X0) )).
cnf(implies_definition,axiom,
( or(not(X3),X4) = implies(X3,X4) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL413-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : vampire --mode casc -t %d %s
% 0.02/1.07 % Computer : n187.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: 130
% 0.02/1.08 lrs+11_2:3_cond=on:gs=on:gsem=on:lwlo=on:nwc=1.7:sas=minisat:stl=30:spl=off:updr=off_123 on theBenchmark
% 13.09/14.18 % (40702)Time limit reached!
% 13.09/14.18 % ------------------------------
% 13.09/14.18 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.09/14.18 % Termination reason: Time limit
% 13.09/14.18 % Termination phase: Saturation
% 13.09/14.18
% 13.09/14.18 % Active clauses: 4369
% 13.09/14.18 % Passive clauses: 43217
% 13.09/14.18 % Generated clauses: 529984
% 13.09/14.18 % Final active clauses: 3757
% 13.09/14.18 % Final passive clauses: 9862
% 13.09/14.18 % Input clauses: 10
% 13.09/14.18 % Initial clauses: 7
% 13.09/14.18 % Discarded non-redundant clauses: 215509
% 13.09/14.18 %
% 13.09/14.18 % Function definitions: 3
% 13.09/14.18 %
% 13.09/14.18 % Fw subsumption resolutions: 18
% 13.09/14.18 % Condensations: 11716
% 13.09/14.18 % Global subsumptions: 1
% 13.09/14.18 %
% 13.09/14.18 % Simple tautologies: 1353
% 13.09/14.18 % Forward subsumptions: 473538
% 13.09/14.18 %
% 13.09/14.18 % Binary resolution: 518566
% 13.09/14.18 %
% 13.09/14.18 % SAT solver clauses: 43219
% 13.09/14.18 % SAT solver unit clauses: 13783
% 13.09/14.18 % SAT solver binary clauses: 21675
% 13.09/14.18 %
% 13.09/14.18 % Memory used [KB]: 244089
% 13.09/14.18 % Time elapsed: 13.100 s
% 13.09/14.18 % ------------------------------
% 13.09/14.18 ---- Runtime statistics ----
% 13.09/14.18 binary resolutions skipped for weight limit before building clause: 9665
% 13.09/14.18 binary resolutions skipped for weight limit while building clause: 176105
% 13.09/14.18 clauses created: 706424
% 13.09/14.18 clauses deleted: 662813
% 13.09/14.18 clauses discarded by weight limit in forward simplification: 141
% 13.09/14.18 clauses discarded from active on weight limit update: 612
% 13.09/14.18 clauses discarded from passive on weight limit update: 28986
% 13.09/14.18 -----------------------------
% 13.09/14.18 % ------------------------------
% 13.09/14.19 % remaining time: 2868 next slice time: 4
% 13.09/14.19 ins+11_3:1_cond=fast:fde=unused:gs=on:igbrr=0.6:igrr=16/1:igrp=400:igrpq=1.1:igs=1002:igwr=on:nwc=1:spl=off_2 on theBenchmark
% 13.59/14.69 % (40705)Time limit reached!
% 13.59/14.69 % ------------------------------
% 13.59/14.69 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.59/14.69 % Termination reason: Time limit
% 13.59/14.69 % Termination phase: Saturation
% 13.59/14.69
% 13.59/14.69 % Active clauses: 36
% 13.59/14.69 % Passive clauses: 80
% 13.59/14.69 % Generated clauses: 100
% 13.59/14.69 % Final active clauses: 36
% 13.59/14.69 % Final passive clauses: 31
% 13.59/14.69 % Input clauses: 10
% 13.59/14.69 % Initial clauses: 8
% 13.59/14.69 %
% 13.59/14.69 % Duplicate literals: 8
% 13.59/14.69 % Fw demodulations: 17
% 13.59/14.69 % Global subsumptions: 2695
% 13.59/14.69 %
% 13.59/14.69 % Simple tautologies: 1401
% 13.59/14.69 % Forward subsumptions: 16
% 13.59/14.69 %
% 13.59/14.69 % Binary resolution: 47
% 13.59/14.69 % Forward superposition: 26
% 13.59/14.69 % Backward superposition: 2
% 13.59/14.69 %
% 13.59/14.69 % SAT solver clauses: 28874
% 13.59/14.69 % SAT solver unit clauses: 11188
% 13.59/14.69 % SAT solver binary clauses: 5340
% 13.59/14.69 % SAT solver learnt clauses: 5439
% 13.59/14.69 % SAT solver learnt literals: 2234
% 13.59/14.69 %
% 13.59/14.69 % InstGen generated clauses: 16080
% 13.59/14.69 % InstGen redundant clauses: 10348
% 13.59/14.69 % InstGen kept clauses: 7839
% 13.59/14.69 % InstGen iterations: 16
% 13.59/14.69 %
% 13.59/14.69 % TWLsolver clauses: 17583
% 13.59/14.69 % TWLsolver calls for satisfiability: 84851
% 13.59/14.69 %
% 13.59/14.69 % Memory used [KB]: 18805
% 13.59/14.69 % Time elapsed: 0.500 s
% 13.59/14.69 % ------------------------------
% 13.59/14.69 ---- Runtime statistics ----
% 13.59/14.69 clauses created: 18905
% 13.59/14.69 clauses deleted: 10356
% 13.59/14.69 -----------------------------
% 13.59/14.69 % ------------------------------
% 13.59/14.69 % remaining time: 2863 next slice time: 7
% 13.59/14.69 dis+11_4_cond=fast:fsr=off:fde=unused:gs=on:gsaa=full_model:gsem=off:lwlo=on:nwc=1:sdd=off:ssfp=1000:ssfq=2.0:smm=sco:ssnc=none:sp=occurrence:urr=on_5 on theBenchmark
% 13.70/14.89 Satisfiable!
% 13.70/14.89 % SZS status Satisfiable for theBenchmark
% 13.70/14.89 % # SZS output start Saturation.
% 13.70/14.89 cnf(u470,axiom,
% 13.70/14.89 theorem(not(not(or(X0,not(X0)))))).
% 13.70/14.89
% 13.70/14.89 cnf(u490,axiom,
% 13.70/14.89 theorem(not(not(X0))) | ~theorem(X0)).
% 13.70/14.89
% 13.70/14.89 cnf(u457,axiom,
% 13.70/14.89 theorem(not(not(implies(X0,X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u2674,axiom,
% 13.70/14.89 theorem(implies(not(X0),implies(X0,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u528,axiom,
% 13.70/14.89 theorem(implies(not(X0),X1)) | ~theorem(X0)).
% 13.70/14.89
% 13.70/14.89 cnf(u492,axiom,
% 13.70/14.89 theorem(implies(not(implies(X0,X0)),X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u217,axiom,
% 13.70/14.89 theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(u62,axiom,
% 13.70/14.89 theorem(implies(implies(X0,X1),or(X1,not(X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u441,axiom,
% 13.70/14.89 theorem(implies(implies(X0,or(X1,X1)),implies(X0,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u444,axiom,
% 13.70/14.89 theorem(implies(implies(X0,X1),implies(X0,or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u52,axiom,
% 13.70/14.89 theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u14,axiom,
% 13.70/14.89 theorem(implies(implies(X0,not(X0)),not(X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(u216,axiom,
% 13.70/14.89 theorem(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u63,axiom,
% 13.70/14.89 theorem(implies(or(X1,not(X0)),implies(X0,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u82,axiom,
% 13.70/14.89 theorem(implies(or(X12,X10),or(X12,X11))) | ~theorem(implies(X10,X11))).
% 13.70/14.89
% 13.70/14.89 cnf(u75,axiom,
% 13.70/14.89 theorem(implies(or(X0,X1),or(X0,or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u74,axiom,
% 13.70/14.89 theorem(implies(or(X0,or(X1,X2)),or(X0,or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u73,axiom,
% 13.70/14.89 theorem(implies(or(X0,or(X1,X1)),or(X0,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u221,axiom,
% 13.70/14.89 theorem(implies(or(X0,X0),or(X1,X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(u31,axiom,
% 13.70/14.89 theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(u13,axiom,
% 13.70/14.89 theorem(implies(or(X0,X1),or(X1,X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(u11,axiom,
% 13.70/14.89 theorem(implies(or(X0,X0),X0))).
% 13.70/14.89
% 13.70/14.89 cnf(u138,axiom,
% 13.70/14.89 theorem(implies(X0,not(implies(X0,not(X0)))))).
% 13.70/14.89
% 13.70/14.89 cnf(u352,axiom,
% 13.70/14.89 theorem(implies(X0,not(not(X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u2503,axiom,
% 13.70/14.89 theorem(implies(X0,implies(not(X0),X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u70,axiom,
% 13.70/14.89 theorem(implies(X0,implies(or(X1,X2),or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u69,axiom,
% 13.70/14.89 theorem(implies(X0,implies(or(X1,X1),X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u26,axiom,
% 13.70/14.89 theorem(implies(X0,implies(X1,implies(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u71,axiom,
% 13.70/14.89 theorem(implies(X0,implies(X1,or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u307,axiom,
% 13.70/14.89 theorem(implies(X0,implies(X1,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u18,axiom,
% 13.70/14.89 theorem(implies(X7,implies(X6,X7)))).
% 13.70/14.89
% 13.70/14.89 cnf(u2494,axiom,
% 13.70/14.89 theorem(implies(X0,or(X0,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u342,axiom,
% 13.70/14.89 theorem(implies(X0,or(X1,not(X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u296,axiom,
% 13.70/14.89 theorem(implies(X0,or(X1,implies(X2,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(u222,axiom,
% 13.70/14.89 theorem(implies(X0,or(X1,or(X2,X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u224,axiom,
% 13.70/14.89 theorem(implies(X1,or(X0,X2))) | ~theorem(or(X0,implies(X1,X2)))).
% 13.70/14.89
% 13.70/14.89 cnf(u12,axiom,
% 13.70/14.89 theorem(implies(X0,or(X1,X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(u29,axiom,
% 13.70/14.89 theorem(implies(X3,X4)) | ~theorem(X4)).
% 13.70/14.89
% 13.70/14.89 cnf(u289,axiom,
% 13.70/14.89 theorem(implies(X0,X0))).
% 13.70/14.89
% 13.70/14.89 cnf(u97,axiom,
% 13.70/14.89 theorem(or(implies(or(X0,X0),X0),X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u133,axiom,
% 13.70/14.89 theorem(or(implies(X0,X1),not(X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u111,axiom,
% 13.70/14.89 theorem(or(implies(X0,or(X1,X0)),X2))).
% 13.70/14.89
% 13.70/14.89 cnf(u688,axiom,
% 13.70/14.89 theorem(or(implies(X0,not(X1)),X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u290,axiom,
% 13.70/14.89 theorem(or(implies(X0,X0),X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u2458,axiom,
% 13.70/14.89 theorem(or(implies(X0,X1),X0))).
% 13.70/14.89
% 13.70/14.89 cnf(u666,axiom,
% 13.70/14.89 theorem(or(or(X0,not(X1)),X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u338,axiom,
% 13.70/14.89 theorem(or(or(X0,not(X0)),X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u2578,axiom,
% 13.70/14.89 theorem(or(or(X0,X1),not(X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(u131,axiom,
% 13.70/14.89 theorem(or(or(X0,X1),not(or(X1,X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u132,axiom,
% 13.70/14.89 theorem(or(or(X0,X1),not(X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u136,axiom,
% 13.70/14.89 theorem(or(X1,not(X0))) | ~theorem(implies(X0,X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u325,axiom,
% 13.70/14.89 theorem(or(X0,not(X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(u130,axiom,
% 13.70/14.89 theorem(or(X0,not(or(X0,X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u2454,axiom,
% 13.70/14.89 theorem(or(X0,implies(X0,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u608,axiom,
% 13.70/14.89 theorem(or(X0,implies(X1,not(X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u23,axiom,
% 13.70/14.89 theorem(or(X0,implies(X1,implies(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u22,axiom,
% 13.70/14.89 theorem(or(X0,implies(X1,or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u282,axiom,
% 13.70/14.89 theorem(or(X0,implies(X1,X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u280,axiom,
% 13.70/14.89 theorem(or(X0,implies(or(X1,or(X0,X2)),or(X1,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(u59,axiom,
% 13.70/14.89 theorem(or(X0,implies(or(X1,X2),or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u279,axiom,
% 13.70/14.89 theorem(or(X0,implies(or(X1,X0),X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u21,axiom,
% 13.70/14.89 theorem(or(X0,implies(or(X1,X1),X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u295,axiom,
% 13.70/14.89 theorem(or(X0,or(X1,implies(X2,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(u560,axiom,
% 13.70/14.89 theorem(or(X0,or(X1,not(X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u341,axiom,
% 13.70/14.89 theorem(or(X0,or(X1,not(X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u28,axiom,
% 13.70/14.89 theorem(or(X1,X2)) | ~theorem(X2)).
% 13.70/14.89
% 13.70/14.89 cnf(u125,axiom,
% 13.70/14.89 theorem(or(X0,X1)) | ~theorem(X0)).
% 13.70/14.89
% 13.70/14.89 cnf(rule_1,axiom,
% 13.70/14.89 theorem(X3) | ~axiom(X3)).
% 13.70/14.89
% 13.70/14.89 cnf(u772,axiom,
% 13.70/14.89 theorem(X0)).
% 13.70/14.89
% 13.70/14.89 cnf(u148,axiom,
% 13.70/14.89 ~theorem(not(X0)) | theorem(implies(X0,X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u85,axiom,
% 13.70/14.89 ~theorem(or(X0,not(X1))) | theorem(implies(X1,X0))).
% 13.70/14.89
% 13.70/14.89 cnf(u79,axiom,
% 13.70/14.89 ~theorem(or(X3,or(X4,X5))) | theorem(or(X4,or(X3,X5)))).
% 13.70/14.89
% 13.70/14.89 cnf(u61,axiom,
% 13.70/14.89 ~theorem(or(X1,X0)) | theorem(or(X0,X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u27,axiom,
% 13.70/14.89 ~theorem(or(X0,X0)) | theorem(X0)).
% 13.70/14.89
% 13.70/14.89 cnf(u83,axiom,
% 13.70/14.89 ~theorem(implies(X13,not(X13))) | theorem(not(X13))).
% 13.70/14.89
% 13.70/14.89 cnf(rule_2,axiom,
% 13.70/14.89 ~theorem(implies(X4,X3)) | theorem(X3) | ~theorem(X4)).
% 13.70/14.89
% 13.70/14.89 cnf(u37,axiom,
% 13.70/14.89 axiom(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(u17,axiom,
% 13.70/14.89 axiom(implies(implies(X4,X5),or(X5,not(X4))))).
% 13.70/14.89
% 13.70/14.89 cnf(u15,axiom,
% 13.70/14.89 axiom(implies(implies(X1,not(X1)),not(X1)))).
% 13.70/14.89
% 13.70/14.89 cnf(u227,axiom,
% 13.70/14.89 axiom(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(u86,axiom,
% 13.70/14.89 axiom(implies(implies(X0,not(X1)),implies(X1,not(X0))))).
% 13.70/14.89
% 13.70/14.89 cnf(u55,axiom,
% 13.70/14.89 axiom(implies(implies(X1,X2),implies(implies(X0,X1),implies(X0,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(axiom_1_6,axiom,
% 13.70/14.89 axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u19,axiom,
% 13.70/14.89 axiom(implies(X9,implies(X8,X9)))).
% 13.70/14.89
% 13.70/14.89 cnf(axiom_1_3,axiom,
% 13.70/14.89 axiom(implies(X0,or(X1,X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(u36,axiom,
% 13.70/14.89 axiom(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1))))).
% 13.70/14.89
% 13.70/14.89 cnf(u16,axiom,
% 13.70/14.89 axiom(implies(or(X3,not(X2)),implies(X2,X3)))).
% 13.70/14.89
% 13.70/14.89 cnf(axiom_1_5,axiom,
% 13.70/14.89 axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))).
% 13.70/14.89
% 13.70/14.89 cnf(axiom_1_4,axiom,
% 13.70/14.89 axiom(implies(or(X0,X1),or(X1,X0)))).
% 13.70/14.89
% 13.70/14.89 cnf(axiom_1_2,axiom,
% 13.70/14.89 axiom(implies(or(X0,X0),X0))).
% 13.70/14.89
% 13.70/14.89 cnf(u220,axiom,
% 13.70/14.89 ~axiom(not(X0)) | theorem(implies(X0,X1))).
% 13.70/14.89
% 13.70/14.89 cnf(u30,axiom,
% 13.70/14.89 ~axiom(implies(X6,X5)) | ~theorem(X6) | theorem(X5)).
% 13.70/14.89
% 13.70/14.89 cnf(u128,axiom,
% 13.70/14.89 ~axiom(or(X8,X7)) | theorem(or(X7,X8))).
% 13.70/14.89
% 13.70/14.89 cnf(u40,axiom,
% 13.70/14.89 ~axiom(or(X0,X0)) | theorem(X0)).
% 13.70/14.89
% 13.70/14.89 cnf(implies_definition,axiom,
% 13.70/14.89 or(not(X3),X4) = implies(X3,X4)).
% 13.70/14.89
% 13.70/14.89 % # SZS output end Saturation.
% 13.70/14.89 % ------------------------------
% 13.70/14.89 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.70/14.89 % Termination reason: Satisfiable
% 13.70/14.89
% 13.70/14.89 % Active clauses: 123
% 13.70/14.89 % Passive clauses: 3182
% 13.70/14.89 % Generated clauses: 4254
% 13.70/14.89 % Final active clauses: 95
% 13.70/14.89 % Input clauses: 10
% 13.70/14.89 % Initial clauses: 8
% 13.70/14.89 %
% 13.70/14.89 % Fw demodulations: 130
% 13.70/14.89 % Global subsumptions: 3
% 13.70/14.89 %
% 13.70/14.89 % Simple tautologies: 7
% 13.70/14.89 % Forward subsumptions: 2277
% 13.70/14.89 %
% 13.70/14.89 % Binary resolution: 159
% 13.70/14.89 % Unit resulting resolution: 3836
% 13.70/14.89 % Forward superposition: 109
% 13.70/14.89 % Backward superposition: 6
% 13.70/14.89 %
% 13.70/14.89 % Split clauses: 2
% 13.70/14.89 % Split components: 4
% 13.70/14.89 % SAT solver clauses: 8712
% 13.70/14.89 % SAT solver unit clauses: 5871
% 13.70/14.89 % SAT solver binary clauses: 1883
% 13.70/14.89 % SAT solver learnt clauses: 2694
% 13.70/14.89 % SAT solver learnt literals: 1760
% 13.70/14.89 %
% 13.70/14.89 % Sat splits: 2
% 13.70/14.89 % Sat splitting refutations: 15
% 13.70/14.89 %
% 13.70/14.89 % TWLsolver clauses: 3327
% 13.70/14.89 % TWLsolver calls for satisfiability: 21269
% 13.70/14.89 %
% 13.70/14.89 % Memory used [KB]: 5373
% 13.70/14.89 % Time elapsed: 0.201 s
% 13.70/14.89 % ------------------------------
% 13.70/14.89 ---- Runtime statistics ----
% 13.70/14.89 clauses created: 4256
% 13.70/14.89 clauses deleted: 808
% 13.70/14.89 ssat_new_components: 3
% 13.70/14.89 ssat_reused_components: 1
% 13.70/14.89 ssat_sat_clauses: 17
% 13.70/14.89 total_frozen: 1264
% 13.70/14.89 unworthy child removed: 103
% 13.70/14.89 -----------------------------
% 13.70/14.89 % ------------------------------
% 13.70/14.89 % Success in time 13.823 s
%------------------------------------------------------------------------------