TSTP Solution File: LCL145-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL145-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Sat May 4 08:17:52 EDT 2024
% Result : Unsatisfiable 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 7 RR)
% Number of literals : 38 ( 37 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/tmp/tmp.GXqCmVfyt4/E---3.1_29158.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.GXqCmVfyt4/E---3.1_29158.p',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/tmp/tmp.GXqCmVfyt4/E---3.1_29158.p',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/tmp/tmp.GXqCmVfyt4/E---3.1_29158.p',wajsberg_4) ).
cnf(prove_wajsberg_theorem,negated_conjecture,
not(big_V(x,y)) != big_hat(not(x),not(y)),
file('/export/starexec/sandbox2/tmp/tmp.GXqCmVfyt4/E---3.1_29158.p',prove_wajsberg_theorem) ).
cnf(big_hat_definition,axiom,
big_hat(X1,X2) = not(big_V(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.GXqCmVfyt4/E---3.1_29158.p',big_hat_definition) ).
cnf(big_V_definition,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/tmp.GXqCmVfyt4/E---3.1_29158.p',big_V_definition) ).
cnf(c_0_7,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_8,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_9,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_10,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_10]),c_0_8]) ).
cnf(c_0_13,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_15,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_14]),c_0_8]),c_0_8]) ).
cnf(c_0_16,plain,
implies(implies(implies(X1,X2),X2),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_15]),c_0_8]) ).
cnf(c_0_17,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_18,plain,
implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_19,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_17,c_0_8]) ).
cnf(c_0_20,plain,
implies(implies(implies(X1,X2),X3),implies(X2,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_8]) ).
cnf(c_0_21,plain,
implies(not(truth),not(not(truth))) = not(not(truth)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_8]) ).
cnf(c_0_22,plain,
implies(not(truth),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_8]) ).
cnf(c_0_23,plain,
implies(implies(not(X1),not(implies(X2,X1))),implies(implies(X1,X2),X2)) = truth,
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_24,plain,
not(not(truth)) = truth,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
implies(not(implies(X1,not(truth))),X1) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_8]),c_0_22]),c_0_8]) ).
cnf(c_0_26,plain,
implies(X1,implies(not(X1),not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_8]) ).
cnf(c_0_27,negated_conjecture,
not(big_V(x,y)) != big_hat(not(x),not(y)),
inference(fof_simplification,[status(thm)],[prove_wajsberg_theorem]) ).
cnf(c_0_28,axiom,
big_hat(X1,X2) = not(big_V(not(X1),not(X2))),
big_hat_definition ).
cnf(c_0_29,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
big_V_definition ).
cnf(c_0_30,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_9,c_0_26]),c_0_8]),c_0_19]),c_0_8]) ).
cnf(c_0_31,negated_conjecture,
not(big_V(x,y)) != big_hat(not(x),not(y)),
c_0_27 ).
cnf(c_0_32,plain,
big_hat(X1,X2) = not(implies(implies(not(X1),not(X2)),not(X2))),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_8]) ).
cnf(c_0_34,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_30]),c_0_22]),c_0_8]) ).
cnf(c_0_35,negated_conjecture,
not(implies(implies(x,y),y)) != not(implies(implies(not(not(x)),not(not(y))),not(not(y)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_29]),c_0_32]) ).
cnf(c_0_36,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL145-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n019.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 08:56:44 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.GXqCmVfyt4/E---3.1_29158.p
% 0.15/0.42 # Version: 3.1.0
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29236 completed with status 0
% 0.15/0.42 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.42 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.42 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/0.42 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.15/0.42 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29241 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.42 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Unsatisfiable
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 9
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 9
% 0.15/0.43 # Removed in clause preprocessing : 2
% 0.15/0.43 # Initial clauses in saturation : 7
% 0.15/0.43 # Processed clauses : 58
% 0.15/0.43 # ...of these trivial : 15
% 0.15/0.43 # ...subsumed : 0
% 0.15/0.43 # ...remaining for further processing : 43
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 15
% 0.15/0.43 # Generated clauses : 602
% 0.15/0.43 # ...of the previous two non-redundant : 235
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 602
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 897
% 0.15/0.43 # ...of those cached : 679
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 21
% 0.15/0.43 # Positive orientable unit clauses : 17
% 0.15/0.43 # Positive unorientable unit clauses: 1
% 0.15/0.43 # Negative unit clauses : 1
% 0.15/0.43 # Non-unit-clauses : 2
% 0.15/0.43 # Current number of unprocessed clauses: 180
% 0.15/0.43 # ...number of literals in the above : 180
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 24
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.43 # Non-unit clause-clause subsumptions : 0
% 0.15/0.43 # Unit Clause-clause subsumption calls : 3
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 78
% 0.15/0.43 # BW rewrite match successes : 23
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 5990
% 0.15/0.43 # Search garbage collected termcells : 6
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.006 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.009 s
% 0.15/0.43 # Maximum resident set size: 1648 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.030 s
% 0.15/0.43 # System time : 0.010 s
% 0.15/0.43 # Total time : 0.041 s
% 0.15/0.43 # Maximum resident set size: 1696 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------