TSTP Solution File: LCL111-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL111-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:23:46 EDT 2023
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 23 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/tmp/tmp.kbtrt631V4/E---3.1_26575.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.kbtrt631V4/E---3.1_26575.p',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.kbtrt631V4/E---3.1_26575.p',wajsberg_3) ).
cnf(prove_mv_25,negated_conjecture,
implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
file('/export/starexec/sandbox/tmp/tmp.kbtrt631V4/E---3.1_26575.p',prove_mv_25) ).
cnf(c_0_4,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_5,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_6,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_7,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).
cnf(c_0_8,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_5]) ).
cnf(c_0_10,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_12,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_5]),c_0_5]) ).
cnf(c_0_13,plain,
implies(implies(implies(X1,X2),X3),implies(X2,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_5]) ).
cnf(c_0_14,plain,
implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_5]) ).
cnf(c_0_15,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_5]) ).
cnf(c_0_16,plain,
implies(X1,implies(X2,implies(X3,X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_5]) ).
cnf(c_0_17,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_5]) ).
cnf(c_0_18,plain,
implies(X1,implies(X2,implies(implies(X1,X3),X3))) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_19,plain,
implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X3,X1)),implies(X3,X1)) = implies(implies(X1,X2),implies(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_5]) ).
cnf(c_0_20,negated_conjecture,
implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
prove_mv_25 ).
cnf(c_0_21,plain,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_17]),c_0_5]),c_0_17]),c_0_5]) ).
cnf(c_0_22,plain,
implies(X1,implies(implies(X2,X3),implies(implies(X1,X2),X3))) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL111-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.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 12:57:19 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.kbtrt631V4/E---3.1_26575.p
% 0.17/0.49 # Version: 3.1pre001
% 0.17/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # new_bool_3 with pid 26656 completed with status 0
% 0.17/0.49 # Result found by new_bool_3
% 0.17/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 26663 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.17/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.17/0.49 # Preprocessing time : 0.001 s
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Unsatisfiable
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 5
% 0.17/0.49 # Removed by relevancy pruning/SinE : 1
% 0.17/0.49 # Initial clauses : 4
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 4
% 0.17/0.49 # Processed clauses : 133
% 0.17/0.49 # ...of these trivial : 77
% 0.17/0.49 # ...subsumed : 10
% 0.17/0.49 # ...remaining for further processing : 46
% 0.17/0.49 # Other redundant clauses eliminated : 0
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 0
% 0.17/0.49 # Backward-rewritten : 17
% 0.17/0.49 # Generated clauses : 5337
% 0.17/0.49 # ...of the previous two non-redundant : 1864
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 0
% 0.17/0.49 # Paramodulations : 5337
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 0
% 0.17/0.49 # Total rewrite steps : 8778
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 29
% 0.17/0.49 # Positive orientable unit clauses : 27
% 0.17/0.49 # Positive unorientable unit clauses: 2
% 0.17/0.49 # Negative unit clauses : 0
% 0.17/0.49 # Non-unit-clauses : 0
% 0.17/0.49 # Current number of unprocessed clauses: 1711
% 0.17/0.49 # ...number of literals in the above : 1711
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 17
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.49 # Non-unit clause-clause subsumptions : 0
% 0.17/0.49 # Unit Clause-clause subsumption calls : 22
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 382
% 0.17/0.49 # BW rewrite match successes : 129
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 53872
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.042 s
% 0.17/0.49 # System time : 0.003 s
% 0.17/0.49 # Total time : 0.045 s
% 0.17/0.49 # Maximum resident set size: 1608 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.043 s
% 0.17/0.49 # System time : 0.005 s
% 0.17/0.49 # Total time : 0.048 s
% 0.17/0.49 # Maximum resident set size: 1668 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------