TSTP Solution File: ALG073+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG073+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 07:18:10 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 128 ( 48 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 145 ( 51 ~; 39 |; 33 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 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 : 56 ( 0 sgn 34 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax4,axiom,
~ ? [X1] :
( sorti2(X1)
& ? [X2] :
( sorti2(X2)
& op2(X1,X1) = X2
& op2(X2,X2) = X1
& op2(X1,X2) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.8BTEQhSaVV/E---3.1_23030.p',ax4) ).
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/tmp/tmp.8BTEQhSaVV/E---3.1_23030.p',co1) ).
fof(ax2,axiom,
! [X1] :
( sorti2(X1)
=> ! [X2] :
( sorti2(X2)
=> sorti2(op2(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.8BTEQhSaVV/E---3.1_23030.p',ax2) ).
fof(ax3,axiom,
? [X1] :
( sorti1(X1)
& ? [X2] :
( sorti1(X2)
& op1(X1,X1) = X2
& op1(X2,X2) = X1
& op1(X1,X2) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.8BTEQhSaVV/E---3.1_23030.p',ax3) ).
fof(ax1,axiom,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> sorti1(op1(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.8BTEQhSaVV/E---3.1_23030.p',ax1) ).
fof(c_0_5,plain,
~ ? [X1] :
( sorti2(X1)
& ? [X2] :
( sorti2(X2)
& op2(X1,X1) = X2
& op2(X2,X2) = X1
& op2(X1,X2) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax4]) ).
fof(c_0_6,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_7,plain,
! [X15,X16] :
( ~ sorti2(X15)
| ~ sorti2(X16)
| op2(X15,X15) != X16
| op2(X16,X16) != X15
| op2(X15,X16) = X15 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X11,X12] :
( ~ sorti2(X11)
| ~ sorti2(X12)
| sorti2(op2(X11,X12)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])])])]) ).
fof(c_0_9,negated_conjecture,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( ~ sorti1(X17)
| sorti2(h(X17)) )
& ( ~ sorti2(X18)
| sorti1(j(X18)) )
& ( ~ sorti1(X19)
| ~ sorti1(X20)
| h(op1(X19,X20)) = op2(h(X19),h(X20)) )
& ( ~ sorti2(X21)
| ~ sorti2(X22)
| j(op2(X21,X22)) = op1(j(X21),j(X22)) )
& ( ~ sorti2(X23)
| h(j(X23)) = X23 )
& ( ~ sorti1(X24)
| j(h(X24)) = X24 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_10,plain,
? [X1] :
( sorti1(X1)
& ? [X2] :
( sorti1(X2)
& op1(X1,X1) = X2
& op1(X2,X2) = X1
& op1(X1,X2) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax3]) ).
cnf(c_0_11,plain,
( op2(X1,X2) = X1
| ~ sorti2(X1)
| ~ sorti2(X2)
| op2(X1,X1) != X2
| op2(X2,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( h(op1(X1,X2)) = op2(h(X1),h(X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
( sorti1(esk1_0)
& sorti1(esk2_0)
& op1(esk1_0,esk1_0) = esk2_0
& op1(esk2_0,esk2_0) = esk1_0
& op1(esk1_0,esk2_0) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])]) ).
cnf(c_0_16,plain,
( op2(op2(X1,X1),X1) = op2(X1,X1)
| op2(op2(X1,X1),op2(X1,X1)) != X1
| ~ sorti2(op2(X1,X1))
| ~ sorti2(X1) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( sorti2(h(op1(X1,X2)))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_14]) ).
cnf(c_0_18,plain,
op1(esk2_0,esk2_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
sorti1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( op2(h(op1(X1,X1)),h(X1)) = h(op1(X1,X1))
| op2(h(op1(X1,X1)),h(op1(X1,X1))) != h(X1)
| ~ sorti2(h(op1(X1,X1)))
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
sorti2(h(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
( op2(h(esk1_0),h(esk2_0)) = h(esk1_0)
| op2(h(esk1_0),h(esk1_0)) != h(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_21]),c_0_19])]) ).
cnf(c_0_23,plain,
sorti1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( h(op1(esk1_0,esk2_0)) = h(esk1_0)
| op2(h(esk1_0),h(esk1_0)) != h(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_19]),c_0_23])]) ).
cnf(c_0_25,plain,
op1(esk1_0,esk1_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
h(op1(esk1_0,esk2_0)) = h(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_25]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
( j(h(esk1_0)) = op1(esk1_0,esk2_0)
| ~ sorti1(op1(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
op1(esk1_0,esk2_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_30,plain,
! [X9,X10] :
( ~ sorti1(X9)
| ~ sorti1(X10)
| sorti1(op1(X9,X10)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
cnf(c_0_31,negated_conjecture,
~ sorti1(op1(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_28]),c_0_23])]),c_0_29]) ).
cnf(c_0_32,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_19]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG073+1 : TPTP v8.1.2. Released v2.7.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 13:47:01 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.8BTEQhSaVV/E---3.1_23030.p
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23110 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSF-FFSS21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 # Starting sh5l with 136s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23115 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSF-FFSS21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 5
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 14
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 14
% 0.19/0.50 # Processed clauses : 71
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 17
% 0.19/0.50 # ...remaining for further processing : 54
% 0.19/0.50 # Other redundant clauses eliminated : 1
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 1
% 0.19/0.50 # Backward-rewritten : 3
% 0.19/0.50 # Generated clauses : 135
% 0.19/0.50 # ...of the previous two non-redundant : 117
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 17
% 0.19/0.50 # Paramodulations : 134
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 1
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 68
% 0.19/0.50 # ...of those cached : 60
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 35
% 0.19/0.50 # Positive orientable unit clauses : 9
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 2
% 0.19/0.50 # Non-unit-clauses : 24
% 0.19/0.50 # Current number of unprocessed clauses: 74
% 0.19/0.50 # ...number of literals in the above : 314
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 18
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 179
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 144
% 0.19/0.50 # Non-unit clause-clause subsumptions : 34
% 0.19/0.50 # Unit Clause-clause subsumption calls : 1
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 4
% 0.19/0.50 # BW rewrite match successes : 3
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 3227
% 0.19/0.50 # Search garbage collected termcells : 351
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.008 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.012 s
% 0.19/0.50 # Maximum resident set size: 1720 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.047 s
% 0.19/0.50 # System time : 0.008 s
% 0.19/0.50 # Total time : 0.055 s
% 0.19/0.50 # Maximum resident set size: 1696 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------