TSTP Solution File: SYN014-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN014-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Tue May 21 07:55:52 EDT 2024
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of clauses : 67 ( 9 unt; 52 nHn; 65 RR)
% Number of literals : 187 ( 118 equ; 52 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_4,negated_conjecture,
( X1 = j
| X1 = k
| ~ element(X1,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_4) ).
cnf(c_11,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
cnf(c_10,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
cnf(c_13,negated_conjecture,
( X1 = n
| element(X1,n)
| element(g(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
cnf(c_17,negated_conjecture,
( X1 = k
| X1 = m
| X1 = n
| ~ element(X1,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_17) ).
cnf(c_2,negated_conjecture,
( n = k
| m = k ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_2) ).
cnf(c_15,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
cnf(c_3,negated_conjecture,
( X1 = j
| element(X1,j)
| X1 != k ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_3) ).
cnf(c_1,negated_conjecture,
m != n,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_1) ).
cnf(c_8,negated_conjecture,
( X1 = m
| element(f(X1),X1)
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_8) ).
cnf(c_6,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).
cnf(c_16,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
cnf(c_5,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).
cnf(c_7,negated_conjecture,
( X1 = m
| element(X1,f(X1))
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).
cnf(c_9,negated_conjecture,
( X1 = m
| element(X1,m)
| X2 = m
| X2 = X1
| ~ element(X1,X2)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_9) ).
cnf(c_0_15,negated_conjecture,
( X1 = j
| X1 = k
| ~ element(X1,j) ),
inference(fof_simplification,[status(thm)],[c_4]) ).
cnf(c_0_16,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != X1 ),
inference(fof_simplification,[status(thm)],[c_11]) ).
cnf(c_0_17,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != n ),
inference(fof_simplification,[status(thm)],[c_10]) ).
cnf(c_0_18,negated_conjecture,
( X1 = j
| X1 = k
| ~ element(X1,j) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
( X1 = n
| element(X1,n)
| element(g(X1),X1) ),
c_13 ).
cnf(c_0_20,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != X1 ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( X1 = k
| X1 = m
| X1 = n
| ~ element(X1,k) ),
inference(fof_simplification,[status(thm)],[c_17]) ).
cnf(c_0_22,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != n ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( g(j) = k
| j = n
| element(j,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( X1 = k
| X1 = m
| X1 = n
| ~ element(X1,k) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
( n = k
| m = k ),
c_2 ).
cnf(c_0_26,negated_conjecture,
( j = n
| element(j,n)
| k != n ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != m ),
inference(fof_simplification,[status(thm)],[c_15]) ).
cnf(c_0_28,negated_conjecture,
( X1 = j
| element(X1,j)
| X1 != k ),
inference(fof_simplification,[status(thm)],[c_3]) ).
cnf(c_0_29,negated_conjecture,
( k = m
| X1 = n
| X1 = m
| ~ element(X1,n) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( k = m
| j = n
| element(j,n) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != m ),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
m != n,
inference(fof_simplification,[status(thm)],[c_1]) ).
cnf(c_0_33,negated_conjecture,
( X1 = j
| element(X1,j)
| X1 != k ),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
( j = m
| j = n
| k = m ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( k = m
| element(m,k) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
m != n,
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( j = k
| element(k,j) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( k = m
| j = m
| X1 = n
| X1 = k
| ~ element(X1,n) ),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( k = m
| element(m,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_25]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( X1 = m
| element(f(X1),X1)
| ~ element(X1,m) ),
inference(fof_simplification,[status(thm)],[c_8]) ).
cnf(c_0_41,negated_conjecture,
( k = m
| j = n
| element(n,j) ),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
cnf(c_0_42,negated_conjecture,
( j = m
| k = m ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( X1 = m
| element(f(X1),X1)
| ~ element(X1,m) ),
c_0_40 ).
cnf(c_0_44,negated_conjecture,
( k = m
| element(n,m) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != X1 ),
inference(fof_simplification,[status(thm)],[c_6]) ).
cnf(c_0_46,negated_conjecture,
( k = m
| element(f(n),n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_36]) ).
cnf(c_0_47,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != n ),
inference(fof_simplification,[status(thm)],[c_16]) ).
cnf(c_0_48,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != m ),
inference(fof_simplification,[status(thm)],[c_5]) ).
cnf(c_0_49,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != X1 ),
c_0_45 ).
cnf(c_0_50,negated_conjecture,
( f(n) = m
| f(n) = n
| k = m ),
inference(spm,[status(thm)],[c_0_29,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != n ),
c_0_47 ).
cnf(c_0_52,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != m ),
c_0_48 ).
cnf(c_0_53,negated_conjecture,
( f(n) = m
| k = m ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_36]),c_0_44]) ).
cnf(c_0_54,negated_conjecture,
( X1 = m
| element(X1,f(X1))
| ~ element(X1,m) ),
inference(fof_simplification,[status(thm)],[c_7]) ).
cnf(c_0_55,negated_conjecture,
( k = n
| element(n,k) ),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_56,negated_conjecture,
k = m,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_36]),c_0_44]) ).
cnf(c_0_57,negated_conjecture,
( X1 = m
| element(X1,m)
| X2 = m
| X2 = X1
| ~ element(X1,X2)
| ~ element(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_9]) ).
cnf(c_0_58,negated_conjecture,
( X1 = m
| element(X1,f(X1))
| ~ element(X1,m) ),
c_0_54 ).
cnf(c_0_59,negated_conjecture,
element(n,m),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_56]),c_0_36]) ).
cnf(c_0_60,negated_conjecture,
( X1 = m
| element(X1,m)
| X2 = m
| X2 = X1
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_0_57 ).
cnf(c_0_61,negated_conjecture,
element(n,f(n)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_36]) ).
cnf(c_0_62,negated_conjecture,
element(f(n),n),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_59]),c_0_36]) ).
cnf(c_0_63,negated_conjecture,
( X1 = n
| X1 = m
| ~ element(X1,m) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_56]),c_0_56])]) ).
cnf(c_0_64,negated_conjecture,
( f(n) = n
| f(n) = m ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_36]),c_0_62])]),c_0_63]) ).
cnf(c_0_65,negated_conjecture,
f(n) = m,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_64]),c_0_59])]),c_0_36]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_65]),c_0_59])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SYN014-1 : TPTP v8.2.0. Released v1.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n008.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 : Mon May 20 14:03:38 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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/benchmark/theBenchmark.p
% 0.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15008 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGUSF-FFSF11-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 # Starting sh5l with 136s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15014 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGUSF-FFSF11-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 17
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 17
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 17
% 0.14/0.41 # Processed clauses : 101
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 22
% 0.14/0.41 # ...remaining for further processing : 79
% 0.14/0.41 # Other redundant clauses eliminated : 3
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 6
% 0.14/0.41 # Backward-rewritten : 33
% 0.14/0.41 # Generated clauses : 112
% 0.14/0.41 # ...of the previous two non-redundant : 113
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 9
% 0.14/0.41 # Paramodulations : 105
% 0.14/0.41 # Factorizations : 4
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 3
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 61
% 0.14/0.41 # ...of those cached : 55
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 20
% 0.14/0.41 # Positive orientable unit clauses : 4
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 15
% 0.14/0.41 # Current number of unprocessed clauses: 16
% 0.14/0.41 # ...number of literals in the above : 80
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 56
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 128
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 75
% 0.14/0.41 # Non-unit clause-clause subsumptions : 32
% 0.14/0.41 # Unit Clause-clause subsumption calls : 3
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 4
% 0.14/0.41 # BW rewrite match successes : 4
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 2269
% 0.14/0.41 # Search garbage collected termcells : 38
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.007 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.008 s
% 0.14/0.41 # Maximum resident set size: 1676 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.033 s
% 0.14/0.41 # System time : 0.005 s
% 0.14/0.41 # Total time : 0.039 s
% 0.14/0.41 # Maximum resident set size: 1700 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------