TSTP Solution File: LCL226-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL226-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:24:16 EDT 2023
% Result : Unsatisfiable 451.21s 136.49s
% Output : CNFRefutation 451.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 22 unt; 0 nHn; 14 RR)
% Number of literals : 51 ( 2 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',axiom_1_6) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',axiom_1_5) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',implies_definition) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',axiom_1_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(or(q,r),implies(or(not(r),s),or(q,s)))),
file('/export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p',prove_this) ).
cnf(c_0_8,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_9,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_10,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_11,plain,
theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( theorem(implies(or(X1,X2),or(X1,X3)))
| ~ theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_14,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_16,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_17,plain,
theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_18,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_19,plain,
theorem(implies(X1,or(X2,X1))),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
theorem(implies(or(X1,X1),X1)),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_24,plain,
( theorem(or(X1,implies(X2,X3)))
| ~ theorem(implies(X2,or(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_15]) ).
cnf(c_0_25,plain,
theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ theorem(implies(or(q,r),implies(or(not(r),s),or(q,s)))),
prove_this ).
cnf(c_0_27,plain,
( theorem(implies(or(X1,X2),X3))
| ~ theorem(implies(or(X1,X4),X3))
| ~ theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_28,plain,
theorem(implies(or(X1,implies(X2,X3)),implies(X2,or(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_15]) ).
cnf(c_0_29,plain,
theorem(or(X1,implies(or(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ theorem(implies(or(q,r),implies(implies(r,s),or(q,s)))),
inference(rw,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_31,plain,
( theorem(implies(or(X1,X2),implies(X3,or(X1,X4))))
| ~ theorem(implies(X2,implies(X3,X4))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_15]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL226-3 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:51:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.CkuZyVLsIl/E---3.1_16845.p
% 451.21/136.49 # Version: 3.1pre001
% 451.21/136.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 451.21/136.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 451.21/136.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 451.21/136.49 # Starting new_bool_3 with 300s (1) cores
% 451.21/136.49 # Starting new_bool_1 with 300s (1) cores
% 451.21/136.49 # Starting sh5l with 300s (1) cores
% 451.21/136.49 # sh5l with pid 16925 completed with status 0
% 451.21/136.49 # Result found by sh5l
% 451.21/136.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 451.21/136.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 451.21/136.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 451.21/136.49 # Starting new_bool_3 with 300s (1) cores
% 451.21/136.49 # Starting new_bool_1 with 300s (1) cores
% 451.21/136.49 # Starting sh5l with 300s (1) cores
% 451.21/136.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 451.21/136.49 # Search class: FHUSM-FFSF21-MFFFFFNN
% 451.21/136.49 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 451.21/136.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 451.21/136.49 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 16930 completed with status 7
% 451.21/136.49 # Starting sh5l with 31s (1) cores
% 451.21/136.49 # sh5l with pid 16936 completed with status 7
% 451.21/136.49 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 28s (1) cores
% 451.21/136.49 # G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with pid 16938 completed with status 0
% 451.21/136.49 # Result found by G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 451.21/136.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 451.21/136.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 451.21/136.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 451.21/136.49 # Starting new_bool_3 with 300s (1) cores
% 451.21/136.49 # Starting new_bool_1 with 300s (1) cores
% 451.21/136.49 # Starting sh5l with 300s (1) cores
% 451.21/136.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 451.21/136.49 # Search class: FHUSM-FFSF21-MFFFFFNN
% 451.21/136.49 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 451.21/136.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 451.21/136.49 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 16930 completed with status 7
% 451.21/136.49 # Starting sh5l with 31s (1) cores
% 451.21/136.49 # sh5l with pid 16936 completed with status 7
% 451.21/136.49 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 28s (1) cores
% 451.21/136.49 # Preprocessing time : 0.001 s
% 451.21/136.49 # Presaturation interreduction done
% 451.21/136.49
% 451.21/136.49 # Proof found!
% 451.21/136.49 # SZS status Unsatisfiable
% 451.21/136.49 # SZS output start CNFRefutation
% See solution above
% 451.21/136.49 # Parsed axioms : 9
% 451.21/136.49 # Removed by relevancy pruning/SinE : 0
% 451.21/136.49 # Initial clauses : 9
% 451.21/136.49 # Removed in clause preprocessing : 0
% 451.21/136.49 # Initial clauses in saturation : 9
% 451.21/136.49 # Processed clauses : 7956
% 451.21/136.49 # ...of these trivial : 256
% 451.21/136.49 # ...subsumed : 6393
% 451.21/136.49 # ...remaining for further processing : 1307
% 451.21/136.49 # Other redundant clauses eliminated : 0
% 451.21/136.49 # Clauses deleted for lack of memory : 0
% 451.21/136.49 # Backward-subsumed : 17
% 451.21/136.49 # Backward-rewritten : 17
% 451.21/136.49 # Generated clauses : 71994
% 451.21/136.49 # ...of the previous two non-redundant : 66702
% 451.21/136.49 # ...aggressively subsumed : 0
% 451.21/136.49 # Contextual simplify-reflections : 0
% 451.21/136.49 # Paramodulations : 71994
% 451.21/136.49 # Factorizations : 0
% 451.21/136.49 # NegExts : 0
% 451.21/136.49 # Equation resolutions : 0
% 451.21/136.49 # Total rewrite steps : 8110
% 451.21/136.49 # Propositional unsat checks : 0
% 451.21/136.49 # Propositional check models : 0
% 451.21/136.49 # Propositional check unsatisfiable : 0
% 451.21/136.49 # Propositional clauses : 0
% 451.21/136.49 # Propositional clauses after purity: 0
% 451.21/136.49 # Propositional unsat core size : 0
% 451.21/136.49 # Propositional preprocessing time : 0.000
% 451.21/136.49 # Propositional encoding time : 0.000
% 451.21/136.49 # Propositional solver time : 0.000
% 451.21/136.49 # Success case prop preproc time : 0.000
% 451.21/136.49 # Success case prop encoding time : 0.000
% 451.21/136.49 # Success case prop solver time : 0.000
% 451.21/136.49 # Current number of processed clauses : 1264
% 451.21/136.49 # Positive orientable unit clauses : 473
% 451.21/136.49 # Positive unorientable unit clauses: 0
% 451.21/136.49 # Negative unit clauses : 31
% 451.21/136.49 # Non-unit-clauses : 760
% 451.21/136.49 # Current number of unprocessed clauses: 56671
% 451.21/136.49 # ...number of literals in the above : 113217
% 451.21/136.49 # Current number of archived formulas : 0
% 451.21/136.49 # Current number of archived clauses : 43
% 451.21/136.49 # Clause-clause subsumption calls (NU) : 108386
% 451.21/136.49 # Rec. Clause-clause subsumption calls : 108300
% 451.21/136.49 # Non-unit clause-clause subsumptions : 7163
% 451.21/136.49 # Unit Clause-clause subsumption calls : 4052
% 451.21/136.49 # Rewrite failures with RHS unbound : 0
% 451.21/136.49 # BW rewrite match attempts : 13645
% 451.21/136.49 # BW rewrite match successes : 17
% 451.21/136.49 # Condensation attempts : 7956
% 451.21/136.49 # Condensation successes : 868
% 451.21/136.49 # Termbank termtop insertions : 859413
% 451.21/136.49
% 451.21/136.49 # -------------------------------------------------
% 451.21/136.49 # User time : 58.506 s
% 451.21/136.49 # System time : 1.096 s
% 451.21/136.49 # Total time : 59.602 s
% 451.21/136.49 # Maximum resident set size: 1652 pages
% 451.21/136.49
% 451.21/136.49 # -------------------------------------------------
% 451.21/136.49 # User time : 58.508 s
% 451.21/136.49 # System time : 1.100 s
% 451.21/136.49 # Total time : 59.608 s
% 451.21/136.49 # Maximum resident set size: 1680 pages
% 451.21/136.49 % E---3.1 exiting
%------------------------------------------------------------------------------