TSTP Solution File: LCL146-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL146-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:41 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 7 RR)
% Number of literals : 53 ( 52 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(big_V_definition,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/tmp.nwGMDDY88r/E---3.1_31673.p',big_V_definition) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nwGMDDY88r/E---3.1_31673.p',wajsberg_1) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/tmp/tmp.nwGMDDY88r/E---3.1_31673.p',wajsberg_4) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/tmp/tmp.nwGMDDY88r/E---3.1_31673.p',wajsberg_3) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/tmp/tmp.nwGMDDY88r/E---3.1_31673.p',wajsberg_2) ).
cnf(big_hat_definition,axiom,
big_hat(X1,X2) = not(big_V(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.nwGMDDY88r/E---3.1_31673.p',big_hat_definition) ).
cnf(prove_wajsberg_theorem,negated_conjecture,
not(big_hat(x,y)) != big_V(not(x),not(y)),
file('/export/starexec/sandbox2/tmp/tmp.nwGMDDY88r/E---3.1_31673.p',prove_wajsberg_theorem) ).
cnf(c_0_7,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
big_V_definition ).
cnf(c_0_8,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_9,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_10,plain,
implies(X1,X1) = big_V(truth,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_12,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_13,plain,
implies(big_V(truth,not(X1)),big_V(truth,X1)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
big_V(X1,X2) = big_V(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7]),c_0_7]) ).
cnf(c_0_15,plain,
implies(X1,big_V(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_8]),c_0_7]) ).
cnf(c_0_16,plain,
implies(big_V(truth,not(X1)),big_V(X1,truth)) = truth,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
big_V(truth,X1) = truth,
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_18,plain,
big_V(X1,truth) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_8]) ).
cnf(c_0_19,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_20,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_8]),c_0_8]) ).
cnf(c_0_21,plain,
big_V(X1,implies(X2,X1)) = implies(big_V(X2,X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_14]) ).
cnf(c_0_22,plain,
implies(implies(big_V(X1,X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_8]) ).
cnf(c_0_23,plain,
implies(X1,big_V(X2,X1)) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_24,plain,
implies(big_V(X1,X2),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_8]),c_0_21]) ).
cnf(c_0_25,plain,
implies(big_V(truth,X1),X1) = big_V(X1,X1),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_26,plain,
implies(X1,big_V(X2,big_V(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_8]) ).
cnf(c_0_27,plain,
big_V(X1,implies(X2,X1)) = implies(X2,X1),
inference(rw,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_28,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_29,axiom,
big_hat(X1,X2) = not(big_V(not(X1),not(X2))),
big_hat_definition ).
cnf(c_0_30,plain,
big_V(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_17]),c_0_8]) ).
cnf(c_0_31,plain,
implies(X1,big_V(X2,implies(X3,X1))) = truth,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
big_V(X1,implies(not(X1),not(truth))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_28]),c_0_8]),c_0_14]) ).
cnf(c_0_33,plain,
big_V(not(truth),not(not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_28]),c_0_14]) ).
cnf(c_0_34,plain,
not(not(X1)) = big_hat(X1,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
implies(not(truth),X1) = truth,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
implies(big_V(X1,X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_37,plain,
big_V(big_hat(truth,truth),not(truth)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_14]) ).
cnf(c_0_38,plain,
big_V(not(truth),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_35]),c_0_8]) ).
cnf(c_0_39,plain,
implies(not(truth),big_hat(truth,truth)) = big_hat(truth,truth),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_8]) ).
cnf(c_0_40,plain,
implies(implies(not(X1),not(implies(X2,X1))),big_V(X2,X1)) = truth,
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_41,plain,
big_V(X1,not(truth)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_42,plain,
big_hat(truth,truth) = truth,
inference(rw,[status(thm)],[c_0_39,c_0_35]) ).
cnf(c_0_43,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_40,c_0_41]),c_0_34]),c_0_42]),c_0_8]) ).
cnf(c_0_44,plain,
implies(X1,implies(not(X1),not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_43]),c_0_8]) ).
cnf(c_0_45,plain,
implies(not(X1),not(truth)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_44]),c_0_8]),c_0_32]) ).
cnf(c_0_46,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_45]),c_0_41]) ).
cnf(c_0_47,plain,
not(not(X1)) = big_hat(truth,X1),
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_48,plain,
big_hat(X1,big_V(not(X2),not(X3))) = not(big_V(not(X1),big_hat(X2,X3))),
inference(spm,[status(thm)],[c_0_29,c_0_29]) ).
cnf(c_0_49,plain,
big_hat(truth,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
not(big_hat(x,y)) != big_V(not(x),not(y)),
prove_wajsberg_theorem ).
cnf(c_0_51,plain,
big_V(not(X1),not(X2)) = not(big_hat(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL146-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 12:26:10 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.nwGMDDY88r/E---3.1_31673.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 31752 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.52 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.21/0.52 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 31755 completed with status 0
% 0.21/0.52 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.52 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 9
% 0.21/0.52 # Removed by relevancy pruning/SinE : 2
% 0.21/0.52 # Initial clauses : 7
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 7
% 0.21/0.52 # Processed clauses : 175
% 0.21/0.52 # ...of these trivial : 63
% 0.21/0.52 # ...subsumed : 15
% 0.21/0.52 # ...remaining for further processing : 97
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 35
% 0.21/0.52 # Generated clauses : 1873
% 0.21/0.52 # ...of the previous two non-redundant : 681
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 1873
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 2430
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 55
% 0.21/0.52 # Positive orientable unit clauses : 53
% 0.21/0.52 # Positive unorientable unit clauses: 2
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 0
% 0.21/0.52 # Current number of unprocessed clauses: 497
% 0.21/0.52 # ...number of literals in the above : 497
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 42
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 5
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 135
% 0.21/0.52 # BW rewrite match successes : 45
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 14363
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.013 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.018 s
% 0.21/0.52 # Maximum resident set size: 1432 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.014 s
% 0.21/0.52 # System time : 0.007 s
% 0.21/0.52 # Total time : 0.021 s
% 0.21/0.52 # Maximum resident set size: 1676 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------