TSTP Solution File: LCL194-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL194-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:55:54 EDT 2024
% Result : Unsatisfiable 6.29s 1.25s
% Output : CNFRefutation 6.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 44 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(rule_3,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_0_7,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_8,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
inference(fof_simplification,[status(thm)],[rule_3]) ).
cnf(c_0_9,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
c_0_7 ).
cnf(c_0_10,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_12,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
c_0_8 ).
cnf(c_0_13,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_14,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_11 ).
cnf(c_0_16,plain,
( theorem(or(not(or(X1,X2)),X3))
| ~ theorem(or(not(or(X2,X1)),X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_19,plain,
( theorem(or(not(or(X1,X2)),or(X3,X4)))
| ~ axiom(or(X3,or(not(or(X2,X1)),X4))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),
c_0_18 ).
cnf(c_0_21,plain,
( theorem(or(X1,or(not(or(X2,X3)),X4)))
| ~ axiom(or(X1,or(not(or(X3,X2)),X4))) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_22,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL194-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 02:24:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/benchmark/theBenchmark.p
% 6.29/1.25 # Version: 3.1.0
% 6.29/1.25 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.29/1.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.29/1.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.29/1.25 # Starting new_bool_3 with 300s (1) cores
% 6.29/1.25 # Starting new_bool_1 with 300s (1) cores
% 6.29/1.25 # Starting sh5l with 300s (1) cores
% 6.29/1.25 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32154 completed with status 0
% 6.29/1.25 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.29/1.25 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.29/1.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.29/1.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.29/1.25 # No SInE strategy applied
% 6.29/1.25 # Search class: FHUNM-FFSF21-MFFFFFNN
% 6.29/1.25 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.29/1.25 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 6.29/1.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.29/1.25 # Starting new_bool_3 with 136s (1) cores
% 6.29/1.25 # Starting new_bool_1 with 136s (1) cores
% 6.29/1.25 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 6.29/1.25 # C12_02_nc_SAT001_MinMin_p005000_rr with pid 32165 completed with status 0
% 6.29/1.25 # Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 6.29/1.25 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.29/1.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.29/1.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.29/1.25 # No SInE strategy applied
% 6.29/1.25 # Search class: FHUNM-FFSF21-MFFFFFNN
% 6.29/1.25 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.29/1.25 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 6.29/1.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.29/1.25 # Starting new_bool_3 with 136s (1) cores
% 6.29/1.25 # Starting new_bool_1 with 136s (1) cores
% 6.29/1.25 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 6.29/1.25 # Preprocessing time : 0.001 s
% 6.29/1.25 # Presaturation interreduction done
% 6.29/1.25
% 6.29/1.25 # Proof found!
% 6.29/1.25 # SZS status Unsatisfiable
% 6.29/1.25 # SZS output start CNFRefutation
% See solution above
% 6.29/1.25 # Parsed axioms : 9
% 6.29/1.25 # Removed by relevancy pruning/SinE : 0
% 6.29/1.25 # Initial clauses : 9
% 6.29/1.25 # Removed in clause preprocessing : 0
% 6.29/1.25 # Initial clauses in saturation : 9
% 6.29/1.25 # Processed clauses : 7882
% 6.29/1.25 # ...of these trivial : 739
% 6.29/1.25 # ...subsumed : 5161
% 6.29/1.25 # ...remaining for further processing : 1982
% 6.29/1.25 # Other redundant clauses eliminated : 0
% 6.29/1.25 # Clauses deleted for lack of memory : 0
% 6.29/1.25 # Backward-subsumed : 34
% 6.29/1.25 # Backward-rewritten : 20
% 6.29/1.25 # Generated clauses : 74251
% 6.29/1.25 # ...of the previous two non-redundant : 64083
% 6.29/1.25 # ...aggressively subsumed : 0
% 6.29/1.25 # Contextual simplify-reflections : 0
% 6.29/1.25 # Paramodulations : 74251
% 6.29/1.25 # Factorizations : 0
% 6.29/1.25 # NegExts : 0
% 6.29/1.25 # Equation resolutions : 0
% 6.29/1.25 # Disequality decompositions : 0
% 6.29/1.25 # Total rewrite steps : 10794
% 6.29/1.25 # ...of those cached : 8076
% 6.29/1.25 # Propositional unsat checks : 0
% 6.29/1.25 # Propositional check models : 0
% 6.29/1.25 # Propositional check unsatisfiable : 0
% 6.29/1.25 # Propositional clauses : 0
% 6.29/1.25 # Propositional clauses after purity: 0
% 6.29/1.25 # Propositional unsat core size : 0
% 6.29/1.25 # Propositional preprocessing time : 0.000
% 6.29/1.25 # Propositional encoding time : 0.000
% 6.29/1.25 # Propositional solver time : 0.000
% 6.29/1.25 # Success case prop preproc time : 0.000
% 6.29/1.25 # Success case prop encoding time : 0.000
% 6.29/1.25 # Success case prop solver time : 0.000
% 6.29/1.25 # Current number of processed clauses : 1919
% 6.29/1.25 # Positive orientable unit clauses : 589
% 6.29/1.25 # Positive unorientable unit clauses: 0
% 6.29/1.25 # Negative unit clauses : 91
% 6.29/1.25 # Non-unit-clauses : 1239
% 6.29/1.25 # Current number of unprocessed clauses: 56123
% 6.29/1.25 # ...number of literals in the above : 85094
% 6.29/1.25 # Current number of archived formulas : 0
% 6.29/1.25 # Current number of archived clauses : 63
% 6.29/1.25 # Clause-clause subsumption calls (NU) : 418148
% 6.29/1.25 # Rec. Clause-clause subsumption calls : 418148
% 6.29/1.25 # Non-unit clause-clause subsumptions : 5032
% 6.29/1.25 # Unit Clause-clause subsumption calls : 38099
% 6.29/1.25 # Rewrite failures with RHS unbound : 0
% 6.29/1.25 # BW rewrite match attempts : 87485
% 6.29/1.25 # BW rewrite match successes : 9
% 6.29/1.25 # Condensation attempts : 0
% 6.29/1.25 # Condensation successes : 0
% 6.29/1.25 # Termbank termtop insertions : 1042191
% 6.29/1.25 # Search garbage collected termcells : 17
% 6.29/1.25
% 6.29/1.25 # -------------------------------------------------
% 6.29/1.25 # User time : 0.708 s
% 6.29/1.25 # System time : 0.032 s
% 6.29/1.25 # Total time : 0.740 s
% 6.29/1.25 # Maximum resident set size: 1664 pages
% 6.29/1.25
% 6.29/1.25 # -------------------------------------------------
% 6.29/1.25 # User time : 3.655 s
% 6.29/1.25 # System time : 0.108 s
% 6.29/1.25 # Total time : 3.763 s
% 6.29/1.25 # Maximum resident set size: 1708 pages
% 6.29/1.25 % E---3.1 exiting
%------------------------------------------------------------------------------