TSTP Solution File: LCL109-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL109-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 11.83s 2.00s
% Output : CNFRefutation 11.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 8 RR)
% Number of literals : 53 ( 52 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/tmp/tmp.OvcIAFomU2/E---3.1_5745.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.OvcIAFomU2/E---3.1_5745.p',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.OvcIAFomU2/E---3.1_5745.p',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/tmp/tmp.OvcIAFomU2/E---3.1_5745.p',wajsberg_4) ).
cnf(prove_mv_4,negated_conjecture,
big_V(implies(x,y),implies(y,x)) != truth,
file('/export/starexec/sandbox/tmp/tmp.OvcIAFomU2/E---3.1_5745.p',prove_mv_4) ).
cnf(big_V_definition,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
file('/export/starexec/sandbox/tmp/tmp.OvcIAFomU2/E---3.1_5745.p',big_V_definition) ).
cnf(c_0_6,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_7,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
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(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_9]),c_0_7]) ).
cnf(c_0_12,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_9,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_6,c_0_13]),c_0_7]),c_0_7]) ).
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_8,c_0_14]),c_0_7]) ).
cnf(c_0_17,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_18,plain,
implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
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_7]) ).
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_6,c_0_14]),c_0_7]) ).
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_11]),c_0_7]) ).
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_7]) ).
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_8]) ).
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_7]),c_0_22]),c_0_7]) ).
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_7]) ).
cnf(c_0_27,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_26]),c_0_7]),c_0_17]),c_0_7]) ).
cnf(c_0_28,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_8,c_0_6]),c_0_7]) ).
cnf(c_0_29,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_27]),c_0_22]),c_0_7]) ).
cnf(c_0_30,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_22]),c_0_7]) ).
cnf(c_0_31,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_6,c_0_6]),c_0_7]) ).
cnf(c_0_32,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_7]) ).
cnf(c_0_33,plain,
implies(not(X1),not(X2)) = implies(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_29]),c_0_15]),c_0_7]),c_0_29]) ).
cnf(c_0_34,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29]),c_0_29]) ).
cnf(c_0_35,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_7]) ).
cnf(c_0_36,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,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_8,c_0_35]),c_0_7]),c_0_35]),c_0_7]) ).
cnf(c_0_38,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
big_V(implies(x,y),implies(y,x)) != truth,
prove_mv_4 ).
cnf(c_0_40,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
big_V_definition ).
cnf(c_0_41,plain,
implies(not(implies(X1,X2)),X3) = implies(X1,implies(not(X3),X2)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
implies(X1,not(implies(implies(not(X1),X2),X2))) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_38]) ).
cnf(c_0_43,plain,
implies(X1,not(implies(implies(not(X2),X1),X2))) = implies(X2,not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_36]),c_0_38]) ).
cnf(c_0_44,plain,
implies(not(X1),implies(implies(not(X2),X1),X2)) = truth,
inference(spm,[status(thm)],[c_0_9,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
implies(implies(implies(x,y),implies(y,x)),implies(y,x)) != truth,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
implies(X1,implies(implies(implies(not(X1),X2),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_41,c_0_42]),c_0_41]),c_0_33]),c_0_33]) ).
cnf(c_0_47,plain,
implies(implies(X1,not(X2)),not(implies(implies(not(X1),X2),X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_43]),c_0_36]),c_0_44]),c_0_7]) ).
cnf(c_0_48,plain,
implies(not(X1),implies(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_7]) ).
cnf(c_0_49,plain,
implies(not(X1),implies(X2,not(X3))) = implies(X2,implies(X3,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_50,negated_conjecture,
implies(y,implies(implies(y,implies(implies(x,y),x)),x)) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_37]),c_0_37]) ).
cnf(c_0_51,plain,
implies(X1,implies(implies(X2,X1),X2)) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33]),c_0_36]),c_0_48]),c_0_33]),c_0_7]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.19 % Problem : LCL109-4 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.20 % Command : run_E %s %d THM
% 0.10/0.40 % Computer : n028.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8042.1875MB
% 0.10/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.40 % CPULimit : 2400
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Mon Oct 2 13:22:07 EDT 2023
% 0.10/0.40 % CPUTime :
% 0.16/0.51 Running first-order model finding
% 0.16/0.51 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.OvcIAFomU2/E---3.1_5745.p
% 11.83/2.00 # Version: 3.1pre001
% 11.83/2.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.83/2.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.83/2.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.83/2.00 # Starting new_bool_3 with 300s (1) cores
% 11.83/2.00 # Starting new_bool_1 with 300s (1) cores
% 11.83/2.00 # Starting sh5l with 300s (1) cores
% 11.83/2.00 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5822 completed with status 0
% 11.83/2.00 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 11.83/2.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.83/2.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.83/2.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.83/2.00 # No SInE strategy applied
% 11.83/2.00 # Search class: FHUSM-FFSF21-MFFFFFNN
% 11.83/2.00 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 11.83/2.00 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.83/2.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.83/2.00 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 11.83/2.00 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 11.83/2.00 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 11.83/2.00 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with pid 5833 completed with status 0
% 11.83/2.00 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U
% 11.83/2.00 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.83/2.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.83/2.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.83/2.00 # No SInE strategy applied
% 11.83/2.00 # Search class: FHUSM-FFSF21-MFFFFFNN
% 11.83/2.00 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 11.83/2.00 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.83/2.00 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.83/2.00 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 11.83/2.00 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 11.83/2.00 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 11.83/2.00 # Preprocessing time : 0.001 s
% 11.83/2.00 # Presaturation interreduction done
% 11.83/2.00
% 11.83/2.00 # Proof found!
% 11.83/2.00 # SZS status Unsatisfiable
% 11.83/2.00 # SZS output start CNFRefutation
% See solution above
% 11.83/2.00 # Parsed axioms : 9
% 11.83/2.00 # Removed by relevancy pruning/SinE : 0
% 11.83/2.00 # Initial clauses : 9
% 11.83/2.00 # Removed in clause preprocessing : 2
% 11.83/2.00 # Initial clauses in saturation : 7
% 11.83/2.00 # Processed clauses : 1738
% 11.83/2.00 # ...of these trivial : 1188
% 11.83/2.00 # ...subsumed : 257
% 11.83/2.00 # ...remaining for further processing : 293
% 11.83/2.00 # Other redundant clauses eliminated : 0
% 11.83/2.00 # Clauses deleted for lack of memory : 0
% 11.83/2.00 # Backward-subsumed : 0
% 11.83/2.00 # Backward-rewritten : 87
% 11.83/2.00 # Generated clauses : 124567
% 11.83/2.00 # ...of the previous two non-redundant : 52088
% 11.83/2.00 # ...aggressively subsumed : 0
% 11.83/2.00 # Contextual simplify-reflections : 0
% 11.83/2.00 # Paramodulations : 124567
% 11.83/2.00 # Factorizations : 0
% 11.83/2.00 # NegExts : 0
% 11.83/2.00 # Equation resolutions : 0
% 11.83/2.00 # Total rewrite steps : 227557
% 11.83/2.00 # Propositional unsat checks : 0
% 11.83/2.00 # Propositional check models : 0
% 11.83/2.00 # Propositional check unsatisfiable : 0
% 11.83/2.00 # Propositional clauses : 0
% 11.83/2.00 # Propositional clauses after purity: 0
% 11.83/2.00 # Propositional unsat core size : 0
% 11.83/2.00 # Propositional preprocessing time : 0.000
% 11.83/2.00 # Propositional encoding time : 0.000
% 11.83/2.00 # Propositional solver time : 0.000
% 11.83/2.00 # Success case prop preproc time : 0.000
% 11.83/2.00 # Success case prop encoding time : 0.000
% 11.83/2.00 # Success case prop solver time : 0.000
% 11.83/2.00 # Current number of processed clauses : 199
% 11.83/2.00 # Positive orientable unit clauses : 184
% 11.83/2.00 # Positive unorientable unit clauses: 12
% 11.83/2.00 # Negative unit clauses : 1
% 11.83/2.00 # Non-unit-clauses : 2
% 11.83/2.00 # Current number of unprocessed clauses: 48937
% 11.83/2.00 # ...number of literals in the above : 48937
% 11.83/2.00 # Current number of archived formulas : 0
% 11.83/2.00 # Current number of archived clauses : 96
% 11.83/2.00 # Clause-clause subsumption calls (NU) : 0
% 11.83/2.00 # Rec. Clause-clause subsumption calls : 0
% 11.83/2.00 # Non-unit clause-clause subsumptions : 0
% 11.83/2.00 # Unit Clause-clause subsumption calls : 274
% 11.83/2.00 # Rewrite failures with RHS unbound : 0
% 11.83/2.00 # BW rewrite match attempts : 6070
% 11.83/2.00 # BW rewrite match successes : 543
% 11.83/2.00 # Condensation attempts : 0
% 11.83/2.00 # Condensation successes : 0
% 11.83/2.00 # Termbank termtop insertions : 1511751
% 11.83/2.00
% 11.83/2.00 # -------------------------------------------------
% 11.83/2.00 # User time : 1.385 s
% 11.83/2.00 # System time : 0.059 s
% 11.83/2.00 # Total time : 1.444 s
% 11.83/2.00 # Maximum resident set size: 1628 pages
% 11.83/2.00
% 11.83/2.00 # -------------------------------------------------
% 11.83/2.00 # User time : 7.057 s
% 11.83/2.00 # System time : 0.223 s
% 11.83/2.00 # Total time : 7.280 s
% 11.83/2.00 # Maximum resident set size: 1672 pages
% 11.83/2.00 % E---3.1 exiting
%------------------------------------------------------------------------------