TSTP Solution File: LCL152-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL152-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:44 EDT 2023
% Result : Unsatisfiable 4.89s 1.00s
% Output : CNFRefutation 4.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of clauses : 49 ( 49 unt; 0 nHn; 11 RR)
% Number of literals : 49 ( 48 equ; 7 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 72 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/tmp/tmp.EKC08xTOP5/E---3.1_11759.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.EKC08xTOP5/E---3.1_11759.p',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.EKC08xTOP5/E---3.1_11759.p',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/tmp/tmp.EKC08xTOP5/E---3.1_11759.p',wajsberg_4) ).
cnf(big_hat_definition,axiom,
big_hat(X1,X2) = not(big_V(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.EKC08xTOP5/E---3.1_11759.p',big_hat_definition) ).
cnf(big_V_definition,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
file('/export/starexec/sandbox/tmp/tmp.EKC08xTOP5/E---3.1_11759.p',big_V_definition) ).
cnf(prove_wajsberg_theorem,negated_conjecture,
implies(big_hat(x,y),z) != implies(implies(x,y),implies(x,z)),
file('/export/starexec/sandbox/tmp/tmp.EKC08xTOP5/E---3.1_11759.p',prove_wajsberg_theorem) ).
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,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_10,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_11,plain,
implies(X1,implies(implies(X2,X1),X1)) = truth,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
cnf(c_0_13,plain,
implies(X1,truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_8]),c_0_12]) ).
cnf(c_0_14,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_8]),c_0_8]) ).
cnf(c_0_15,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
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_10,c_0_14]),c_0_8]) ).
cnf(c_0_17,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_18,plain,
implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_19,plain,
implies(not(not(truth)),not(truth)) = not(truth),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,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_14]),c_0_8]) ).
cnf(c_0_21,plain,
implies(not(truth),not(not(truth))) = not(not(truth)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12]),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_17]),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_15,c_0_10]) ).
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_15,c_0_25]),c_0_8]) ).
cnf(c_0_27,axiom,
big_hat(X1,X2) = not(big_V(not(X1),not(X2))),
big_hat_definition ).
cnf(c_0_28,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
big_V_definition ).
cnf(c_0_29,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_10,c_0_26]),c_0_8]),c_0_17]),c_0_8]) ).
cnf(c_0_30,negated_conjecture,
implies(big_hat(x,y),z) != implies(implies(x,y),implies(x,z)),
prove_wajsberg_theorem ).
cnf(c_0_31,plain,
big_hat(X1,X2) = not(implies(implies(not(X1),not(X2)),not(X2))),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_29]),c_0_22]),c_0_8]) ).
cnf(c_0_33,negated_conjecture,
implies(not(implies(implies(not(x),not(y)),not(y))),z) != implies(implies(x,y),implies(x,z)),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
implies(implies(X1,X2),implies(not(X2),not(X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_32]),c_0_32]) ).
cnf(c_0_35,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_8]) ).
cnf(c_0_36,negated_conjecture,
implies(not(implies(implies(not(y),not(x)),not(x))),z) != implies(implies(x,y),implies(x,z)),
inference(spm,[status(thm)],[c_0_33,c_0_10]) ).
cnf(c_0_37,plain,
implies(not(X1),not(X2)) = implies(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_34]),c_0_8]),c_0_15]),c_0_8]) ).
cnf(c_0_38,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_32]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
implies(not(implies(implies(x,y),not(x))),z) != implies(implies(x,y),implies(x,z)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,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_7,c_0_7]),c_0_8]) ).
cnf(c_0_42,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_9]),c_0_8]) ).
cnf(c_0_43,negated_conjecture,
implies(not(z),implies(implies(x,y),not(x))) != implies(implies(x,y),implies(x,z)),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_8]) ).
cnf(c_0_46,negated_conjecture,
implies(not(z),implies(x,not(implies(x,y)))) != implies(implies(x,y),implies(x,z)),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,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_10,c_0_45]),c_0_8]),c_0_45]),c_0_8]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_37]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : LCL152-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n031.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 12:45:28 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.EKC08xTOP5/E---3.1_11759.p
% 4.89/1.00 # Version: 3.1pre001
% 4.89/1.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.89/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.89/1.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.89/1.00 # Starting new_bool_3 with 300s (1) cores
% 4.89/1.00 # Starting new_bool_1 with 300s (1) cores
% 4.89/1.00 # Starting sh5l with 300s (1) cores
% 4.89/1.00 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11837 completed with status 0
% 4.89/1.00 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 4.89/1.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.89/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.89/1.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.89/1.00 # No SInE strategy applied
% 4.89/1.00 # Search class: FHUSM-FFSF21-MFFFFFNN
% 4.89/1.00 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 4.89/1.00 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.89/1.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 4.89/1.00 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 4.89/1.00 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.89/1.00 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 4.89/1.00 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11842 completed with status 0
% 4.89/1.00 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.89/1.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.89/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.89/1.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.89/1.00 # No SInE strategy applied
% 4.89/1.00 # Search class: FHUSM-FFSF21-MFFFFFNN
% 4.89/1.00 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 4.89/1.00 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.89/1.00 # Preprocessing time : 0.001 s
% 4.89/1.00 # Presaturation interreduction done
% 4.89/1.00
% 4.89/1.00 # Proof found!
% 4.89/1.00 # SZS status Unsatisfiable
% 4.89/1.00 # SZS output start CNFRefutation
% See solution above
% 4.89/1.00 # Parsed axioms : 9
% 4.89/1.00 # Removed by relevancy pruning/SinE : 0
% 4.89/1.00 # Initial clauses : 9
% 4.89/1.00 # Removed in clause preprocessing : 2
% 4.89/1.00 # Initial clauses in saturation : 7
% 4.89/1.00 # Processed clauses : 670
% 4.89/1.00 # ...of these trivial : 441
% 4.89/1.00 # ...subsumed : 28
% 4.89/1.00 # ...remaining for further processing : 201
% 4.89/1.00 # Other redundant clauses eliminated : 0
% 4.89/1.00 # Clauses deleted for lack of memory : 0
% 4.89/1.00 # Backward-subsumed : 0
% 4.89/1.00 # Backward-rewritten : 79
% 4.89/1.00 # Generated clauses : 58046
% 4.89/1.00 # ...of the previous two non-redundant : 18412
% 4.89/1.00 # ...aggressively subsumed : 0
% 4.89/1.00 # Contextual simplify-reflections : 0
% 4.89/1.00 # Paramodulations : 58046
% 4.89/1.00 # Factorizations : 0
% 4.89/1.00 # NegExts : 0
% 4.89/1.00 # Equation resolutions : 0
% 4.89/1.00 # Total rewrite steps : 101389
% 4.89/1.00 # Propositional unsat checks : 0
% 4.89/1.00 # Propositional check models : 0
% 4.89/1.00 # Propositional check unsatisfiable : 0
% 4.89/1.00 # Propositional clauses : 0
% 4.89/1.00 # Propositional clauses after purity: 0
% 4.89/1.00 # Propositional unsat core size : 0
% 4.89/1.00 # Propositional preprocessing time : 0.000
% 4.89/1.00 # Propositional encoding time : 0.000
% 4.89/1.00 # Propositional solver time : 0.000
% 4.89/1.00 # Success case prop preproc time : 0.000
% 4.89/1.00 # Success case prop encoding time : 0.000
% 4.89/1.00 # Success case prop solver time : 0.000
% 4.89/1.00 # Current number of processed clauses : 115
% 4.89/1.00 # Positive orientable unit clauses : 109
% 4.89/1.00 # Positive unorientable unit clauses: 4
% 4.89/1.00 # Negative unit clauses : 0
% 4.89/1.00 # Non-unit-clauses : 2
% 4.89/1.00 # Current number of unprocessed clauses: 17613
% 4.89/1.00 # ...number of literals in the above : 17613
% 4.89/1.00 # Current number of archived formulas : 0
% 4.89/1.00 # Current number of archived clauses : 88
% 4.89/1.00 # Clause-clause subsumption calls (NU) : 0
% 4.89/1.00 # Rec. Clause-clause subsumption calls : 0
% 4.89/1.00 # Non-unit clause-clause subsumptions : 0
% 4.89/1.00 # Unit Clause-clause subsumption calls : 94
% 4.89/1.00 # Rewrite failures with RHS unbound : 0
% 4.89/1.00 # BW rewrite match attempts : 2035
% 4.89/1.00 # BW rewrite match successes : 465
% 4.89/1.00 # Condensation attempts : 0
% 4.89/1.00 # Condensation successes : 0
% 4.89/1.00 # Termbank termtop insertions : 654498
% 4.89/1.00
% 4.89/1.00 # -------------------------------------------------
% 4.89/1.00 # User time : 0.549 s
% 4.89/1.00 # System time : 0.023 s
% 4.89/1.00 # Total time : 0.573 s
% 4.89/1.00 # Maximum resident set size: 1632 pages
% 4.89/1.00
% 4.89/1.00 # -------------------------------------------------
% 4.89/1.00 # User time : 2.766 s
% 4.89/1.00 # System time : 0.108 s
% 4.89/1.00 # Total time : 2.874 s
% 4.89/1.00 # Maximum resident set size: 1676 pages
% 4.89/1.00 % E---3.1 exiting
% 4.89/1.00 % E---3.1 exiting
%------------------------------------------------------------------------------