TSTP Solution File: LCL109-5 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL109-5 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:11:34 EDT 2023
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 22 unt; 0 nHn; 10 RR)
% Number of literals : 44 ( 23 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',wajsberg_1) ).
cnf(big_V_definition,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',big_V_definition) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',wajsberg_3) ).
cnf(lemma_3_1,axiom,
( ordered(X2,implies(X1,X3))
| ~ ordered(X1,implies(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',lemma_3_1) ).
cnf(lemma_1,axiom,
( ordered(implies(X1,X3),implies(X2,X3))
| ~ ordered(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',lemma_1) ).
cnf(partial_order_definition2,axiom,
( ordered(X1,X2)
| implies(X1,X2) != truth ),
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',partial_order_definition2) ).
cnf(partial_order_definition1,axiom,
( implies(X1,X2) = truth
| ~ ordered(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',partial_order_definition1) ).
cnf(prove_mv_4,negated_conjecture,
big_V(implies(x,y),implies(y,x)) != truth,
file('/export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p',prove_mv_4) ).
cnf(c_0_9,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_10,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_11,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
big_V_definition ).
cnf(c_0_12,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_13,plain,
implies(X1,big_V(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
big_V(X1,X2) = big_V(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).
cnf(c_0_15,plain,
big_V(truth,X1) = truth,
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_16,plain,
implies(X1,X1) = big_V(truth,X1),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_17,plain,
big_V(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( ordered(X2,implies(X1,X3))
| ~ ordered(X1,implies(X2,X3)) ),
lemma_3_1 ).
cnf(c_0_19,axiom,
( ordered(implies(X1,X3),implies(X2,X3))
| ~ ordered(X1,X2) ),
lemma_1 ).
cnf(c_0_20,plain,
implies(big_V(truth,X1),X1) = big_V(X1,X1),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_21,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_22,plain,
( ordered(X1,big_V(X2,X3))
| ~ ordered(X2,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_11]) ).
cnf(c_0_23,plain,
big_V(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_15]),c_0_10]) ).
cnf(c_0_24,plain,
( ordered(X1,truth)
| ~ ordered(X2,truth) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_21]) ).
cnf(c_0_25,axiom,
( ordered(X1,X2)
| implies(X1,X2) != truth ),
partial_order_definition2 ).
cnf(c_0_26,plain,
( ordered(X1,X2)
| ~ ordered(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
ordered(X1,truth),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21])]) ).
cnf(c_0_28,axiom,
( implies(X1,X2) = truth
| ~ ordered(X1,X2) ),
partial_order_definition1 ).
cnf(c_0_29,plain,
ordered(truth,X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
big_V(implies(x,y),implies(y,x)) != truth,
prove_mv_4 ).
cnf(c_0_31,plain,
X1 = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_10]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL109-5 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 11:42:24 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.9P0VeXyYkm/E---3.1_17742.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 17821 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.16/0.45 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.16/0.45 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17825 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.16/0.45 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 17
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 17
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 17
% 0.16/0.45 # Processed clauses : 67
% 0.16/0.45 # ...of these trivial : 4
% 0.16/0.45 # ...subsumed : 8
% 0.16/0.45 # ...remaining for further processing : 55
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 35
% 0.16/0.45 # Generated clauses : 287
% 0.16/0.45 # ...of the previous two non-redundant : 258
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 287
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 164
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 4
% 0.16/0.45 # Positive orientable unit clauses : 2
% 0.16/0.45 # Positive unorientable unit clauses: 1
% 0.16/0.45 # Negative unit clauses : 0
% 0.16/0.45 # Non-unit-clauses : 1
% 0.16/0.45 # Current number of unprocessed clauses: 218
% 0.16/0.45 # ...number of literals in the above : 304
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 51
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 20
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 20
% 0.16/0.45 # Non-unit clause-clause subsumptions : 4
% 0.16/0.45 # Unit Clause-clause subsumption calls : 7
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 120
% 0.16/0.45 # BW rewrite match successes : 67
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 2807
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.003 s
% 0.16/0.45 # System time : 0.004 s
% 0.16/0.45 # Total time : 0.007 s
% 0.16/0.45 # Maximum resident set size: 1636 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.003 s
% 0.16/0.45 # System time : 0.007 s
% 0.16/0.45 # Total time : 0.010 s
% 0.16/0.45 # Maximum resident set size: 1680 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------