TSTP Solution File: ALG177+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG177+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:22:52 EDT 2024
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 3 unt; 0 def)
% Number of atoms : 113 ( 35 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 141 ( 60 ~; 40 |; 19 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 30 !; 4 ?)
% 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/sandbox2/tmp/tmp.qJmotgjsi5/E---3.1_14945.p',co1) ).
fof(ax3,axiom,
? [X1] :
( sorti1(X1)
& ! [X2] :
( sorti1(X2)
=> op1(X1,X2) != X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.qJmotgjsi5/E---3.1_14945.p',ax3) ).
fof(ax4,axiom,
~ ? [X1] :
( sorti2(X1)
& ! [X2] :
( sorti2(X2)
=> op2(X1,X2) != X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.qJmotgjsi5/E---3.1_14945.p',ax4) ).
fof(c_0_3,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_4,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_3])])])]) ).
fof(c_0_5,plain,
? [X1] :
( sorti1(X1)
& ! [X2] :
( sorti1(X2)
=> op1(X1,X2) != X2 ) ),
inference(fof_simplification,[status(thm)],[ax3]) ).
cnf(c_0_6,negated_conjecture,
( j(op2(X1,X2)) = op1(j(X1),j(X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X20] :
( sorti1(esk1_0)
& ( ~ sorti1(X20)
| op1(esk1_0,X20) != X20 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_10,negated_conjecture,
( j(op2(h(X1),X2)) = op1(X1,j(X2))
| ~ sorti2(X2)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( h(op1(X1,X2)) = op2(h(X1),h(X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( ~ sorti1(X1)
| op1(esk1_0,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( op1(X1,j(h(X2))) = j(h(op1(X1,X2)))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]) ).
cnf(c_0_14,plain,
sorti1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( j(h(op1(esk1_0,X1))) != j(h(X1))
| ~ sorti1(j(h(X1)))
| ~ sorti1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
( h(op1(X1,j(X2))) = op2(h(X1),X2)
| ~ sorti2(X2)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( j(op2(h(esk1_0),X1)) != j(h(j(X1)))
| ~ sorti2(X1)
| ~ sorti1(j(h(j(X1)))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( j(h(j(X1))) != op1(esk1_0,j(X1))
| ~ sorti2(X1)
| ~ sorti1(j(h(j(X1)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
( j(h(j(X1))) != op1(esk1_0,j(X1))
| ~ sorti2(h(j(X1)))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( op1(esk1_0,j(X1)) != j(X1)
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
fof(c_0_23,plain,
~ ? [X1] :
( sorti2(X1)
& ! [X2] :
( sorti2(X2)
=> op2(X1,X2) != X2 ) ),
inference(fof_simplification,[status(thm)],[ax4]) ).
cnf(c_0_24,negated_conjecture,
( j(h(op1(esk1_0,X1))) != j(h(X1))
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14])]),c_0_8]) ).
fof(c_0_25,plain,
! [X23] :
( ( sorti2(esk2_1(X23))
| ~ sorti2(X23) )
& ( op2(X23,esk2_1(X23)) = esk2_1(X23)
| ~ sorti2(X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])]) ).
cnf(c_0_26,negated_conjecture,
( j(op2(h(esk1_0),X1)) != j(h(j(X1)))
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_14])]),c_0_16]) ).
cnf(c_0_27,plain,
( op2(X1,esk2_1(X1)) = esk2_1(X1)
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
( sorti2(esk2_1(X1))
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( j(h(j(esk2_1(h(esk1_0))))) != j(esk2_1(h(esk1_0)))
| ~ sorti2(h(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
~ sorti2(h(esk1_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_8]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ALG177+1 : TPTP v8.1.2. Released v2.7.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 13:50:52 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.qJmotgjsi5/E---3.1_14945.p
% 0.18/0.50 # Version: 3.1.0
% 0.18/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # new_bool_3 with pid 15024 completed with status 0
% 0.18/0.50 # Result found by new_bool_3
% 0.18/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 # Search class: FHHSF-FFSF21-SFFFFFNN
% 0.18/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 15027 completed with status 0
% 0.18/0.50 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 # Search class: FHHSF-FFSF21-SFFFFFNN
% 0.18/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50 # Preprocessing time : 0.001 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 5
% 0.18/0.50 # Removed by relevancy pruning/SinE : 0
% 0.18/0.50 # Initial clauses : 12
% 0.18/0.50 # Removed in clause preprocessing : 0
% 0.18/0.50 # Initial clauses in saturation : 12
% 0.18/0.50 # Processed clauses : 376
% 0.18/0.50 # ...of these trivial : 0
% 0.18/0.50 # ...subsumed : 250
% 0.18/0.50 # ...remaining for further processing : 126
% 0.18/0.50 # Other redundant clauses eliminated : 0
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 12
% 0.18/0.50 # Backward-rewritten : 0
% 0.18/0.50 # Generated clauses : 1241
% 0.18/0.50 # ...of the previous two non-redundant : 1204
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 90
% 0.18/0.50 # Paramodulations : 1241
% 0.18/0.50 # Factorizations : 0
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 0
% 0.18/0.50 # Disequality decompositions : 0
% 0.18/0.50 # Total rewrite steps : 26
% 0.18/0.50 # ...of those cached : 25
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 102
% 0.18/0.50 # Positive orientable unit clauses : 1
% 0.18/0.50 # Positive unorientable unit clauses: 0
% 0.18/0.50 # Negative unit clauses : 1
% 0.18/0.50 # Non-unit-clauses : 100
% 0.18/0.50 # Current number of unprocessed clauses: 842
% 0.18/0.50 # ...number of literals in the above : 4502
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 24
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 3158
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 1433
% 0.18/0.50 # Non-unit clause-clause subsumptions : 347
% 0.18/0.50 # Unit Clause-clause subsumption calls : 10
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 0
% 0.18/0.50 # BW rewrite match successes : 0
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 23097
% 0.18/0.50 # Search garbage collected termcells : 345
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.032 s
% 0.18/0.50 # System time : 0.003 s
% 0.18/0.50 # Total time : 0.035 s
% 0.18/0.50 # Maximum resident set size: 1708 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.034 s
% 0.18/0.50 # System time : 0.004 s
% 0.18/0.50 # Total time : 0.038 s
% 0.18/0.50 # Maximum resident set size: 1700 pages
% 0.18/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------