TSTP Solution File: LCL195-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL195-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:07 EDT 2023
% Result : Unsatisfiable 11.06s 1.89s
% Output : CNFRefutation 11.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 16 unt; 0 nHn; 14 RR)
% Number of literals : 44 ( 0 equ; 18 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 : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.p',rule_2) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.p',axiom_1_4) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.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/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.p',rule_3) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.p',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))),
file('/export/starexec/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.p',prove_this) ).
cnf(c_0_7,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_8,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_9,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_11,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_13,plain,
theorem(or(or(X1,X2),not(or(X2,X1)))),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
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,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_17,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,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_14,c_0_12]) ).
cnf(c_0_19,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X1,or(X3,X2)))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_21,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X2,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( theorem(or(not(or(X1,X2)),X3))
| ~ theorem(or(not(or(X2,X1)),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_23,plain,
theorem(or(not(or(X1,X2)),or(not(or(not(X2),X3)),or(X3,X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
theorem(or(not(or(X1,X2)),or(not(or(not(X1),X3)),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))),
prove_this ).
cnf(c_0_26,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X1,X3)),or(X2,X3)))),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL195-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.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 13:01:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.0vfYrkTc7J/E---3.1_28273.p
% 11.06/1.89 # Version: 3.1pre001
% 11.06/1.89 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.06/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.06/1.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.06/1.89 # Starting new_bool_3 with 300s (1) cores
% 11.06/1.89 # Starting new_bool_1 with 300s (1) cores
% 11.06/1.89 # Starting sh5l with 300s (1) cores
% 11.06/1.89 # new_bool_3 with pid 28351 completed with status 0
% 11.06/1.89 # Result found by new_bool_3
% 11.06/1.89 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.06/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.06/1.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.06/1.89 # Starting new_bool_3 with 300s (1) cores
% 11.06/1.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.06/1.89 # Search class: FHUNM-FFSF21-MFFFFFNN
% 11.06/1.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.06/1.89 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 11.06/1.89 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 28355 completed with status 0
% 11.06/1.89 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 11.06/1.89 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.06/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.06/1.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.06/1.89 # Starting new_bool_3 with 300s (1) cores
% 11.06/1.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.06/1.89 # Search class: FHUNM-FFSF21-MFFFFFNN
% 11.06/1.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.06/1.89 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 11.06/1.89 # Preprocessing time : 0.001 s
% 11.06/1.89 # Presaturation interreduction done
% 11.06/1.89
% 11.06/1.89 # Proof found!
% 11.06/1.89 # SZS status Unsatisfiable
% 11.06/1.89 # SZS output start CNFRefutation
% See solution above
% 11.06/1.89 # Parsed axioms : 9
% 11.06/1.89 # Removed by relevancy pruning/SinE : 0
% 11.06/1.89 # Initial clauses : 9
% 11.06/1.89 # Removed in clause preprocessing : 0
% 11.06/1.89 # Initial clauses in saturation : 9
% 11.06/1.89 # Processed clauses : 7177
% 11.06/1.89 # ...of these trivial : 328
% 11.06/1.89 # ...subsumed : 208
% 11.06/1.89 # ...remaining for further processing : 6641
% 11.06/1.89 # Other redundant clauses eliminated : 0
% 11.06/1.89 # Clauses deleted for lack of memory : 0
% 11.06/1.89 # Backward-subsumed : 0
% 11.06/1.89 # Backward-rewritten : 1
% 11.06/1.89 # Generated clauses : 39363
% 11.06/1.89 # ...of the previous two non-redundant : 24081
% 11.06/1.89 # ...aggressively subsumed : 0
% 11.06/1.89 # Contextual simplify-reflections : 0
% 11.06/1.89 # Paramodulations : 39363
% 11.06/1.89 # Factorizations : 0
% 11.06/1.89 # NegExts : 0
% 11.06/1.89 # Equation resolutions : 0
% 11.06/1.89 # Total rewrite steps : 15600
% 11.06/1.89 # Propositional unsat checks : 0
% 11.06/1.89 # Propositional check models : 0
% 11.06/1.89 # Propositional check unsatisfiable : 0
% 11.06/1.89 # Propositional clauses : 0
% 11.06/1.89 # Propositional clauses after purity: 0
% 11.06/1.89 # Propositional unsat core size : 0
% 11.06/1.89 # Propositional preprocessing time : 0.000
% 11.06/1.89 # Propositional encoding time : 0.000
% 11.06/1.89 # Propositional solver time : 0.000
% 11.06/1.89 # Success case prop preproc time : 0.000
% 11.06/1.89 # Success case prop encoding time : 0.000
% 11.06/1.89 # Success case prop solver time : 0.000
% 11.06/1.89 # Current number of processed clauses : 6631
% 11.06/1.89 # Positive orientable unit clauses : 6523
% 11.06/1.89 # Positive unorientable unit clauses: 0
% 11.06/1.89 # Negative unit clauses : 13
% 11.06/1.89 # Non-unit-clauses : 95
% 11.06/1.89 # Current number of unprocessed clauses: 16922
% 11.06/1.89 # ...number of literals in the above : 17092
% 11.06/1.89 # Current number of archived formulas : 0
% 11.06/1.89 # Current number of archived clauses : 10
% 11.06/1.89 # Clause-clause subsumption calls (NU) : 6829
% 11.06/1.89 # Rec. Clause-clause subsumption calls : 6829
% 11.06/1.89 # Non-unit clause-clause subsumptions : 202
% 11.06/1.89 # Unit Clause-clause subsumption calls : 153
% 11.06/1.89 # Rewrite failures with RHS unbound : 0
% 11.06/1.89 # BW rewrite match attempts : 7263805
% 11.06/1.89 # BW rewrite match successes : 1
% 11.06/1.89 # Condensation attempts : 0
% 11.06/1.89 # Condensation successes : 0
% 11.06/1.89 # Termbank termtop insertions : 605351
% 11.06/1.89
% 11.06/1.89 # -------------------------------------------------
% 11.06/1.89 # User time : 1.335 s
% 11.06/1.89 # System time : 0.046 s
% 11.06/1.89 # Total time : 1.381 s
% 11.06/1.89 # Maximum resident set size: 1644 pages
% 11.06/1.89
% 11.06/1.89 # -------------------------------------------------
% 11.06/1.89 # User time : 1.337 s
% 11.06/1.89 # System time : 0.047 s
% 11.06/1.89 # Total time : 1.384 s
% 11.06/1.89 # Maximum resident set size: 1684 pages
% 11.06/1.89 % E---3.1 exiting
%------------------------------------------------------------------------------