TSTP Solution File: ALG070+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG070+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Mon May 20 18:00:33 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 11 unt; 0 def)
% Number of atoms : 126 ( 45 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 135 ( 49 ~; 42 |; 16 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax4,axiom,
~ ! [X1] :
( sorti2(X1)
=> ! [X2] :
( sorti2(X2)
=> ( op2(X1,X1) != X2
| op2(X1,X2) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(ax3,axiom,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> ( op1(X1,X1) != X2
| op1(X1,X2) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(ax1,axiom,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> sorti1(op1(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
fof(c_0_4,negated_conjecture,
~ ( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ sorti1(X9)
| sorti2(h(X9)) )
& ( ~ sorti2(X10)
| sorti1(j(X10)) )
& ( ~ sorti1(X11)
| ~ sorti1(X12)
| h(op1(X11,X12)) = op2(h(X11),h(X12)) )
& ( ~ sorti2(X13)
| ~ sorti2(X14)
| j(op2(X13,X14)) = op1(j(X13),j(X14)) )
& ( ~ sorti2(X15)
| h(j(X15)) = X15 )
& ( ~ sorti1(X16)
| j(h(X16)) = X16 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_6,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( j(h(j(X1))) = j(X1)
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( j(h(j(h(X1)))) = j(h(X1))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( j(h(j(h(j(X1))))) = j(h(j(X1)))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
fof(c_0_12,plain,
~ ! [X1] :
( sorti2(X1)
=> ! [X2] :
( sorti2(X2)
=> ( op2(X1,X1) != X2
| op2(X1,X2) = X1 ) ) ),
inference(fof_simplification,[status(thm)],[ax4]) ).
fof(c_0_13,plain,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> ( op1(X1,X1) != X2
| op1(X1,X2) = X1 ) ) ),
inference(fof_simplification,[status(thm)],[ax3]) ).
cnf(c_0_14,negated_conjecture,
( j(h(j(h(j(h(X1)))))) = j(h(j(h(X1))))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
fof(c_0_15,plain,
( sorti2(esk1_0)
& sorti2(esk2_0)
& op2(esk1_0,esk1_0) = esk2_0
& op2(esk1_0,esk2_0) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_16,plain,
! [X19,X20] :
( ~ sorti1(X19)
| ~ sorti1(X20)
| op1(X19,X19) != X20
| op1(X19,X20) = X19 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_17,negated_conjecture,
( j(h(j(h(j(h(j(X1))))))) = j(h(j(h(j(X1)))))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
sorti2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( op1(X1,X2) = X1
| ~ sorti1(X1)
| ~ sorti1(X2)
| op1(X1,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X17,X18] :
( ~ sorti1(X17)
| ~ sorti1(X18)
| sorti1(op1(X17,X18)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
cnf(c_0_22,negated_conjecture,
( j(op2(X1,X2)) = op1(j(X1),j(X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
sorti2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( sorti1(j(h(j(h(j(X1))))))
| ~ sorti2(h(j(h(j(h(j(X1)))))))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
h(j(esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( op1(X1,op1(X1,X1)) = X1
| ~ sorti1(op1(X1,X1))
| ~ sorti1(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( op1(j(X1),j(esk1_0)) = j(op2(X1,esk1_0))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
op2(esk1_0,esk1_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,negated_conjecture,
h(j(esk1_0)) = esk1_0,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( h(op1(X1,X2)) = op2(h(X1),h(X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,negated_conjecture,
sorti1(j(esk2_0)),
inference(cn,[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_24,c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_19]),c_0_19])]) ).
cnf(c_0_33,plain,
( op1(X1,op1(X1,X1)) = X1
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
op1(j(esk1_0),j(esk1_0)) = j(esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
sorti1(j(esk1_0)),
inference(cn,[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_24,c_0_30]),c_0_30]),c_0_30]),c_0_30]),c_0_23]),c_0_23])]) ).
cnf(c_0_36,negated_conjecture,
( h(op1(X1,j(esk2_0))) = op2(h(X1),esk2_0)
| ~ sorti1(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25]) ).
cnf(c_0_37,negated_conjecture,
op1(j(esk1_0),j(esk2_0)) = j(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_38,plain,
op2(esk1_0,esk2_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_37]),c_0_30]),c_0_30]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : ALG070+1 : TPTP v8.2.0. Released v2.7.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 22:37:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/benchmark/theBenchmark.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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_1 with pid 22248 completed with status 0
% 0.21/0.52 # Result found by new_bool_1
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FHUSF-FFSS21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.21/0.52 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 22253 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FHUSF-FFSS21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (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 Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 5
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 13
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 13
% 0.21/0.52 # Processed clauses : 52
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 52
% 0.21/0.52 # Other redundant clauses eliminated : 1
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 2
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 122
% 0.21/0.52 # ...of the previous two non-redundant : 81
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 121
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 1
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 146
% 0.21/0.52 # ...of those cached : 137
% 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 : 36
% 0.21/0.52 # Positive orientable unit clauses : 10
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 25
% 0.21/0.52 # Current number of unprocessed clauses: 54
% 0.21/0.52 # ...number of literals in the above : 146
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 15
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 55
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 55
% 0.21/0.52 # Non-unit clause-clause subsumptions : 1
% 0.21/0.52 # Unit Clause-clause subsumption calls : 1
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 1
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3206
% 0.21/0.52 # Search garbage collected termcells : 357
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.005 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.009 s
% 0.21/0.52 # Maximum resident set size: 1704 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.005 s
% 0.21/0.52 # System time : 0.007 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 1696 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------