TSTP Solution File: LCL113-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL113-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:26:26 EDT 2024
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 4 RR)
% Number of literals : 30 ( 29 equ; 3 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 : 43 ( 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.uzJcpiVQMm/E---3.1_20868.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.uzJcpiVQMm/E---3.1_20868.p',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.uzJcpiVQMm/E---3.1_20868.p',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/tmp/tmp.uzJcpiVQMm/E---3.1_20868.p',wajsberg_4) ).
cnf(prove_mv_33,negated_conjecture,
implies(implies(not(x),y),implies(not(y),x)) != truth,
file('/export/starexec/sandbox/tmp/tmp.uzJcpiVQMm/E---3.1_20868.p',prove_mv_33) ).
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,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_24,negated_conjecture,
implies(implies(not(x),y),implies(not(y),x)) != truth,
inference(fof_simplification,[status(thm)],[prove_mv_33]) ).
cnf(c_0_25,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_8,c_0_23]),c_0_6]),c_0_14]),c_0_6]) ).
cnf(c_0_26,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_22]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
implies(implies(not(x),y),implies(not(y),x)) != truth,
c_0_24 ).
cnf(c_0_28,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL113-2 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n012.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:46:10 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.39 Running first-order model finding
% 0.15/0.39 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.uzJcpiVQMm/E---3.1_20868.p
% 0.15/0.41 # Version: 3.1.0
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20946 completed with status 0
% 0.15/0.41 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.41 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.41 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.15/0.41 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.15/0.41 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/0.41 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 20953 completed with status 0
% 0.15/0.41 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.41 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.41 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 5
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 5
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 5
% 0.15/0.41 # Processed clauses : 87
% 0.15/0.41 # ...of these trivial : 48
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 39
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 13
% 0.15/0.41 # Generated clauses : 1433
% 0.15/0.41 # ...of the previous two non-redundant : 376
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 1433
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Disequality decompositions : 0
% 0.15/0.41 # Total rewrite steps : 1963
% 0.15/0.41 # ...of those cached : 1498
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 26
% 0.15/0.41 # Positive orientable unit clauses : 24
% 0.15/0.41 # Positive unorientable unit clauses: 2
% 0.15/0.41 # Negative unit clauses : 0
% 0.15/0.41 # Non-unit-clauses : 0
% 0.15/0.41 # Current number of unprocessed clauses: 277
% 0.15/0.41 # ...number of literals in the above : 277
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 13
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.41 # Non-unit clause-clause subsumptions : 0
% 0.15/0.41 # Unit Clause-clause subsumption calls : 1
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 87
% 0.15/0.41 # BW rewrite match successes : 30
% 0.15/0.41 # Condensation attempts : 87
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 10445
% 0.15/0.41 # Search garbage collected termcells : 2
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.007 s
% 0.15/0.41 # System time : 0.003 s
% 0.15/0.41 # Total time : 0.010 s
% 0.15/0.41 # Maximum resident set size: 1548 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.038 s
% 0.15/0.41 # System time : 0.010 s
% 0.15/0.41 # Total time : 0.049 s
% 0.15/0.41 # Maximum resident set size: 1684 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------