TSTP Solution File: LCL208-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL208-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:10 EDT 2023
% Result : Unsatisfiable 0.15s 0.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 21 unt; 0 nHn; 15 RR)
% Number of literals : 51 ( 0 equ; 19 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.aLghCRt4Zu/E---3.1_32604.p',rule_2) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.aLghCRt4Zu/E---3.1_32604.p',axiom_1_4) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.aLghCRt4Zu/E---3.1_32604.p',rule_1) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox2/tmp/tmp.aLghCRt4Zu/E---3.1_32604.p',axiom_1_2) ).
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.aLghCRt4Zu/E---3.1_32604.p',axiom_1_6) ).
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.aLghCRt4Zu/E---3.1_32604.p',rule_3) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.aLghCRt4Zu/E---3.1_32604.p',axiom_1_3) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.aLghCRt4Zu/E---3.1_32604.p',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
file('/export/starexec/sandbox2/tmp/tmp.aLghCRt4Zu/E---3.1_32604.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,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_15,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_16,plain,
theorem(or(X1,not(or(X1,X1)))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
rule_3 ).
cnf(c_0_18,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_19,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_20,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(or(not(or(X4,X1)),or(X4,X2))),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_21,plain,
theorem(or(not(or(X1,or(X2,X2))),or(X1,X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_23,plain,
( theorem(or(not(or(X1,X2)),X3))
| ~ theorem(or(not(or(X2,X1)),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_24,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X2,X1)),X2))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_26,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X3,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_27,plain,
theorem(or(not(or(X1,not(X2))),or(not(or(X1,X2)),X1))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_25]) ).
cnf(c_0_29,plain,
theorem(or(not(not(X1)),or(not(or(X2,X1)),X2))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
theorem(or(not(or(X1,X2)),or(not(not(X2)),X1))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
prove_this ).
cnf(c_0_32,plain,
theorem(or(not(or(X1,X2)),or(not(not(X1)),X2))),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL208-1 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 12:09:14 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.43 Running first-order model finding
% 0.15/0.43 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.aLghCRt4Zu/E---3.1_32604.p
% 0.15/0.48 # Version: 3.1pre001
% 0.15/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 # Starting sh5l with 300s (1) cores
% 0.15/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32683 completed with status 0
% 0.15/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48 # No SInE strategy applied
% 0.15/0.48 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.48 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.15/0.48 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 32689 completed with status 0
% 0.15/0.48 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.15/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48 # No SInE strategy applied
% 0.15/0.48 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.15/0.48 # Preprocessing time : 0.001 s
% 0.15/0.48 # Presaturation interreduction done
% 0.15/0.48
% 0.15/0.48 # Proof found!
% 0.15/0.48 # SZS status Unsatisfiable
% 0.15/0.48 # SZS output start CNFRefutation
% See solution above
% 0.15/0.48 # Parsed axioms : 9
% 0.15/0.48 # Removed by relevancy pruning/SinE : 0
% 0.15/0.48 # Initial clauses : 9
% 0.15/0.48 # Removed in clause preprocessing : 0
% 0.15/0.48 # Initial clauses in saturation : 9
% 0.15/0.48 # Processed clauses : 640
% 0.15/0.48 # ...of these trivial : 28
% 0.15/0.48 # ...subsumed : 54
% 0.15/0.48 # ...remaining for further processing : 558
% 0.15/0.48 # Other redundant clauses eliminated : 0
% 0.15/0.48 # Clauses deleted for lack of memory : 0
% 0.15/0.48 # Backward-subsumed : 0
% 0.15/0.48 # Backward-rewritten : 1
% 0.15/0.48 # Generated clauses : 3205
% 0.15/0.48 # ...of the previous two non-redundant : 1940
% 0.15/0.48 # ...aggressively subsumed : 0
% 0.15/0.48 # Contextual simplify-reflections : 0
% 0.15/0.48 # Paramodulations : 3205
% 0.15/0.48 # Factorizations : 0
% 0.15/0.48 # NegExts : 0
% 0.15/0.48 # Equation resolutions : 0
% 0.15/0.48 # Total rewrite steps : 1283
% 0.15/0.48 # Propositional unsat checks : 0
% 0.15/0.48 # Propositional check models : 0
% 0.15/0.48 # Propositional check unsatisfiable : 0
% 0.15/0.48 # Propositional clauses : 0
% 0.15/0.48 # Propositional clauses after purity: 0
% 0.15/0.48 # Propositional unsat core size : 0
% 0.15/0.48 # Propositional preprocessing time : 0.000
% 0.15/0.48 # Propositional encoding time : 0.000
% 0.15/0.48 # Propositional solver time : 0.000
% 0.15/0.48 # Success case prop preproc time : 0.000
% 0.15/0.48 # Success case prop encoding time : 0.000
% 0.15/0.48 # Success case prop solver time : 0.000
% 0.15/0.48 # Current number of processed clauses : 548
% 0.15/0.48 # Positive orientable unit clauses : 495
% 0.15/0.48 # Positive unorientable unit clauses: 0
% 0.15/0.48 # Negative unit clauses : 9
% 0.15/0.48 # Non-unit-clauses : 44
% 0.15/0.48 # Current number of unprocessed clauses: 1318
% 0.15/0.48 # ...number of literals in the above : 1401
% 0.15/0.48 # Current number of archived formulas : 0
% 0.15/0.48 # Current number of archived clauses : 10
% 0.15/0.48 # Clause-clause subsumption calls (NU) : 750
% 0.15/0.48 # Rec. Clause-clause subsumption calls : 750
% 0.15/0.48 # Non-unit clause-clause subsumptions : 52
% 0.15/0.48 # Unit Clause-clause subsumption calls : 110
% 0.15/0.48 # Rewrite failures with RHS unbound : 0
% 0.15/0.48 # BW rewrite match attempts : 40966
% 0.15/0.48 # BW rewrite match successes : 1
% 0.15/0.48 # Condensation attempts : 0
% 0.15/0.48 # Condensation successes : 0
% 0.15/0.48 # Termbank termtop insertions : 40994
% 0.15/0.48
% 0.15/0.48 # -------------------------------------------------
% 0.15/0.48 # User time : 0.034 s
% 0.15/0.48 # System time : 0.006 s
% 0.15/0.48 # Total time : 0.040 s
% 0.15/0.48 # Maximum resident set size: 1596 pages
% 0.15/0.48
% 0.15/0.48 # -------------------------------------------------
% 0.15/0.48 # User time : 0.182 s
% 0.15/0.48 # System time : 0.018 s
% 0.15/0.48 # Total time : 0.200 s
% 0.15/0.48 # Maximum resident set size: 1680 pages
% 0.15/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------