TSTP Solution File: LCL114-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL114-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:36 EDT 2023
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 3 RR)
% Number of literals : 26 ( 25 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; 3 con; 0-2 aty)
% Number of variables : 38 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/tmp/tmp.fJuPlPomNo/E---3.1_9005.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.fJuPlPomNo/E---3.1_9005.p',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/tmp/tmp.fJuPlPomNo/E---3.1_9005.p',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/tmp/tmp.fJuPlPomNo/E---3.1_9005.p',wajsberg_4) ).
cnf(prove_mv_36,negated_conjecture,
implies(implies(x,y),implies(not(y),not(x))) != truth,
file('/export/starexec/sandbox2/tmp/tmp.fJuPlPomNo/E---3.1_9005.p',prove_mv_36) ).
cnf(c_0_5,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_6,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_7,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_8,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_9,plain,
implies(X1,implies(implies(X2,X1),X1)) = truth,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_11,plain,
implies(X1,truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),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_5,c_0_11]),c_0_6]),c_0_6]) ).
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_5,c_0_12]),c_0_6]) ).
cnf(c_0_14,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_15,plain,
implies(not(X1),implies(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_6]) ).
cnf(c_0_16,plain,
implies(not(truth),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_17,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_6]) ).
cnf(c_0_18,plain,
implies(not(implies(X1,not(truth))),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_19,plain,
implies(X1,implies(not(X1),not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_18]),c_0_6]) ).
cnf(c_0_20,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_21,plain,
implies(not(X1),not(truth)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_19]),c_0_6]),c_0_20]),c_0_6]) ).
cnf(c_0_22,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_21]),c_0_16]),c_0_6]) ).
cnf(c_0_23,negated_conjecture,
implies(implies(x,y),implies(not(y),not(x))) != truth,
prove_mv_36 ).
cnf(c_0_24,plain,
implies(implies(X1,X2),implies(not(X2),not(X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_22]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL114-2 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 11:53:46 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.fJuPlPomNo/E---3.1_9005.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9084 completed with status 0
% 0.16/0.44 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/0.44 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.44 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.16/0.44 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.16/0.44 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.16/0.44 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 9092 completed with status 0
% 0.16/0.44 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/0.44 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.44 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Unsatisfiable
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 5
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 5
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 5
% 0.16/0.44 # Processed clauses : 84
% 0.16/0.44 # ...of these trivial : 48
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 36
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 7
% 0.16/0.44 # Generated clauses : 1259
% 0.16/0.44 # ...of the previous two non-redundant : 319
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 1259
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 1725
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 29
% 0.16/0.44 # Positive orientable unit clauses : 28
% 0.16/0.44 # Positive unorientable unit clauses: 1
% 0.16/0.44 # Negative unit clauses : 0
% 0.16/0.44 # Non-unit-clauses : 0
% 0.16/0.44 # Current number of unprocessed clauses: 224
% 0.16/0.44 # ...number of literals in the above : 224
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 7
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 0
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 62
% 0.16/0.44 # BW rewrite match successes : 7
% 0.16/0.44 # Condensation attempts : 84
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 9314
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.007 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.010 s
% 0.16/0.44 # Maximum resident set size: 1504 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.043 s
% 0.16/0.44 # System time : 0.007 s
% 0.16/0.44 # Total time : 0.050 s
% 0.16/0.44 # Maximum resident set size: 1664 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------