TSTP Solution File: LCL191-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL191-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:05 EDT 2023
% Result : Unsatisfiable 16.26s 2.59s
% Output : CNFRefutation 16.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of clauses : 46 ( 30 unt; 0 nHn; 16 RR)
% Number of literals : 66 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 113 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',rule_2) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',axiom_1_4) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',rule_1) ).
cnf(rule_3,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',rule_3) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',axiom_1_3) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',axiom_1_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(or(p,q),r))),
file('/export/starexec/sandbox2/tmp/tmp.nGsxTFLgTZ/E---3.1_17194.p',prove_this) ).
cnf(c_0_9,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_10,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_11,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_13,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
rule_3 ).
cnf(c_0_15,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_16,plain,
theorem(or(or(X1,X2),not(or(X2,X1)))),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X3,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,plain,
( theorem(or(not(or(X1,X2)),X3))
| ~ theorem(or(not(or(X2,X1)),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_20,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_22,plain,
theorem(or(not(or(X1,X2)),or(or(X2,X1),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_24,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_21]) ).
cnf(c_0_25,plain,
theorem(or(not(X1),or(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_26,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_27,plain,
theorem(or(not(or(X1,X2)),or(X1,or(or(X2,X3),X4)))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_29,plain,
theorem(or(X1,or(not(or(X1,X2)),or(or(X2,X3),X4)))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_31,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_32,plain,
theorem(or(or(not(or(X1,X2)),or(or(X2,X3),X4)),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_33,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_30]) ).
cnf(c_0_34,plain,
theorem(or(or(not(or(X1,X2)),or(or(X2,X3),X4)),or(X5,X1))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
theorem(or(not(or(or(or(X1,X2),X3),X1)),or(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
( theorem(or(not(or(X1,or(X2,X3))),X4))
| ~ theorem(or(not(or(X2,or(X1,X3))),X4)) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_37,plain,
theorem(or(not(or(X1,or(or(X1,X2),X3))),or(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_38,plain,
theorem(or(not(or(or(X1,X2),or(X1,X3))),or(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
theorem(or(not(or(or(X1,X2),or(X1,X3))),or(or(X1,X3),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_40,plain,
theorem(or(not(or(X1,or(or(X1,X2),X3))),or(or(X1,X3),X2))),
inference(spm,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_41,plain,
theorem(or(not(or(or(X1,X2),X3)),or(or(X1,X3),X2))),
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_42,plain,
theorem(or(not(or(X1,or(X2,X3))),or(or(X2,X1),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(or(p,q),r))),
prove_this ).
cnf(c_0_44,plain,
theorem(or(not(or(X1,or(X2,X3))),or(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_36,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL191-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 12:58:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/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.nGsxTFLgTZ/E---3.1_17194.p
% 16.26/2.59 # Version: 3.1pre001
% 16.26/2.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 16.26/2.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.26/2.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.26/2.59 # Starting new_bool_3 with 300s (1) cores
% 16.26/2.59 # Starting new_bool_1 with 300s (1) cores
% 16.26/2.59 # Starting sh5l with 300s (1) cores
% 16.26/2.59 # sh5l with pid 17275 completed with status 0
% 16.26/2.59 # Result found by sh5l
% 16.26/2.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 16.26/2.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.26/2.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.26/2.59 # Starting new_bool_3 with 300s (1) cores
% 16.26/2.59 # Starting new_bool_1 with 300s (1) cores
% 16.26/2.59 # Starting sh5l with 300s (1) cores
% 16.26/2.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 16.26/2.59 # Search class: FHUNM-FFSF21-MFFFFFNN
% 16.26/2.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 16.26/2.59 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 163s (1) cores
% 16.26/2.59 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 17282 completed with status 0
% 16.26/2.59 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 16.26/2.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 16.26/2.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.26/2.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.26/2.59 # Starting new_bool_3 with 300s (1) cores
% 16.26/2.59 # Starting new_bool_1 with 300s (1) cores
% 16.26/2.59 # Starting sh5l with 300s (1) cores
% 16.26/2.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 16.26/2.59 # Search class: FHUNM-FFSF21-MFFFFFNN
% 16.26/2.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 16.26/2.59 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 163s (1) cores
% 16.26/2.59 # Preprocessing time : 0.001 s
% 16.26/2.59 # Presaturation interreduction done
% 16.26/2.59
% 16.26/2.59 # Proof found!
% 16.26/2.59 # SZS status Unsatisfiable
% 16.26/2.59 # SZS output start CNFRefutation
% See solution above
% 16.26/2.59 # Parsed axioms : 9
% 16.26/2.59 # Removed by relevancy pruning/SinE : 0
% 16.26/2.59 # Initial clauses : 9
% 16.26/2.59 # Removed in clause preprocessing : 0
% 16.26/2.59 # Initial clauses in saturation : 9
% 16.26/2.59 # Processed clauses : 9149
% 16.26/2.59 # ...of these trivial : 452
% 16.26/2.59 # ...subsumed : 208
% 16.26/2.59 # ...remaining for further processing : 8489
% 16.26/2.59 # Other redundant clauses eliminated : 0
% 16.26/2.59 # Clauses deleted for lack of memory : 0
% 16.26/2.59 # Backward-subsumed : 0
% 16.26/2.59 # Backward-rewritten : 25
% 16.26/2.59 # Generated clauses : 50137
% 16.26/2.59 # ...of the previous two non-redundant : 30573
% 16.26/2.59 # ...aggressively subsumed : 0
% 16.26/2.59 # Contextual simplify-reflections : 0
% 16.26/2.59 # Paramodulations : 50137
% 16.26/2.59 # Factorizations : 0
% 16.26/2.59 # NegExts : 0
% 16.26/2.59 # Equation resolutions : 0
% 16.26/2.59 # Total rewrite steps : 20030
% 16.26/2.59 # Propositional unsat checks : 0
% 16.26/2.59 # Propositional check models : 0
% 16.26/2.59 # Propositional check unsatisfiable : 0
% 16.26/2.59 # Propositional clauses : 0
% 16.26/2.59 # Propositional clauses after purity: 0
% 16.26/2.59 # Propositional unsat core size : 0
% 16.26/2.59 # Propositional preprocessing time : 0.000
% 16.26/2.59 # Propositional encoding time : 0.000
% 16.26/2.59 # Propositional solver time : 0.000
% 16.26/2.59 # Success case prop preproc time : 0.000
% 16.26/2.59 # Success case prop encoding time : 0.000
% 16.26/2.59 # Success case prop solver time : 0.000
% 16.26/2.59 # Current number of processed clauses : 8455
% 16.26/2.59 # Positive orientable unit clauses : 8347
% 16.26/2.59 # Positive unorientable unit clauses: 0
% 16.26/2.59 # Negative unit clauses : 13
% 16.26/2.59 # Non-unit-clauses : 95
% 16.26/2.59 # Current number of unprocessed clauses: 21442
% 16.26/2.59 # ...number of literals in the above : 21612
% 16.26/2.59 # Current number of archived formulas : 0
% 16.26/2.59 # Current number of archived clauses : 34
% 16.26/2.59 # Clause-clause subsumption calls (NU) : 6829
% 16.26/2.59 # Rec. Clause-clause subsumption calls : 6829
% 16.26/2.59 # Non-unit clause-clause subsumptions : 202
% 16.26/2.59 # Unit Clause-clause subsumption calls : 151
% 16.26/2.59 # Rewrite failures with RHS unbound : 0
% 16.26/2.59 # BW rewrite match attempts : 11790448
% 16.26/2.59 # BW rewrite match successes : 25
% 16.26/2.59 # Condensation attempts : 0
% 16.26/2.59 # Condensation successes : 0
% 16.26/2.59 # Termbank termtop insertions : 780243
% 16.26/2.59
% 16.26/2.59 # -------------------------------------------------
% 16.26/2.59 # User time : 1.976 s
% 16.26/2.59 # System time : 0.066 s
% 16.26/2.59 # Total time : 2.042 s
% 16.26/2.59 # Maximum resident set size: 1640 pages
% 16.26/2.59
% 16.26/2.59 # -------------------------------------------------
% 16.26/2.59 # User time : 1.978 s
% 16.26/2.59 # System time : 0.066 s
% 16.26/2.59 # Total time : 2.044 s
% 16.26/2.59 # Maximum resident set size: 1684 pages
% 16.26/2.59 % E---3.1 exiting
%------------------------------------------------------------------------------