TSTP Solution File: SYN013-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN013-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:28:11 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 11 unt; 28 nHn; 42 RR)
% Number of literals : 129 ( 70 equ; 45 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 : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_16,negated_conjecture,
( X1 = k
| X1 = m
| X1 = n
| ~ element(X1,k) ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_16) ).
cnf(c_7,negated_conjecture,
( X1 = m
| element(f(X1),X1)
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_7) ).
cnf(c_3,negated_conjecture,
k != m,
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_3) ).
cnf(c_12,negated_conjecture,
( X1 = n
| element(X1,n)
| element(g(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_12) ).
cnf(c_2,negated_conjecture,
n != k,
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_2) ).
cnf(c_15,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != n ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_15) ).
cnf(c_5,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_5) ).
cnf(c_10,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_10) ).
cnf(c_8,negated_conjecture,
( X1 = m
| element(X1,m)
| X2 = m
| X2 = X1
| ~ element(X1,X2)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_8) ).
cnf(c_1,negated_conjecture,
m != n,
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_1) ).
cnf(c_4,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != m ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_4) ).
cnf(c_11,negated_conjecture,
( X1 = n
| element(X1,n)
| element(X1,g(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_11) ).
cnf(c_6,negated_conjecture,
( X1 = m
| element(X1,f(X1))
| ~ element(X1,m) ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_6) ).
cnf(c_9,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != n ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_9) ).
cnf(c_13,negated_conjecture,
( X1 = n
| X2 = n
| X2 = X1
| ~ element(X1,n)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_13) ).
cnf(c_14,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != m ),
file('/export/starexec/sandbox2/tmp/tmp.JewRBGVUTh/E---3.1_14965.p',c_14) ).
cnf(c_0_16,negated_conjecture,
( X1 = k
| X1 = m
| X1 = n
| ~ element(X1,k) ),
c_16 ).
cnf(c_0_17,negated_conjecture,
( X1 = m
| element(f(X1),X1)
| ~ element(X1,m) ),
c_7 ).
cnf(c_0_18,negated_conjecture,
k != m,
c_3 ).
cnf(c_0_19,negated_conjecture,
( X1 = n
| element(X1,n)
| element(g(X1),X1) ),
c_12 ).
cnf(c_0_20,negated_conjecture,
n != k,
c_2 ).
cnf(c_0_21,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != n ),
c_15 ).
cnf(c_0_22,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != X1 ),
c_5 ).
cnf(c_0_23,negated_conjecture,
( f(k) = k
| f(k) = n
| f(k) = m
| ~ element(k,m) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != X1 ),
c_10 ).
cnf(c_0_25,negated_conjecture,
( g(k) = k
| g(k) = n
| g(k) = m
| element(k,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( X1 = m
| element(X1,m)
| X2 = m
| X2 = X1
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_8 ).
cnf(c_0_27,negated_conjecture,
element(n,k),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_21]),c_0_20]) ).
cnf(c_0_28,negated_conjecture,
m != n,
c_1 ).
cnf(c_0_29,negated_conjecture,
( X1 = m
| ~ element(X1,m)
| f(X1) != m ),
c_4 ).
cnf(c_0_30,negated_conjecture,
( f(k) = m
| f(k) = n
| ~ element(k,m) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]) ).
cnf(c_0_31,negated_conjecture,
( X1 = n
| element(X1,n)
| element(X1,g(X1)) ),
c_11 ).
cnf(c_0_32,negated_conjecture,
( g(k) = m
| g(k) = n
| element(k,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20]) ).
cnf(c_0_33,negated_conjecture,
( element(k,m)
| ~ element(k,n) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_18]),c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( X1 = m
| element(X1,f(X1))
| ~ element(X1,m) ),
c_6 ).
cnf(c_0_35,negated_conjecture,
( f(k) = n
| ~ element(k,m) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18]) ).
cnf(c_0_36,negated_conjecture,
( X1 = n
| element(X1,n)
| g(X1) != n ),
c_9 ).
cnf(c_0_37,negated_conjecture,
( g(k) = n
| element(k,m) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( element(k,n)
| ~ element(k,m) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18]) ).
cnf(c_0_39,negated_conjecture,
( X1 = n
| X2 = n
| X2 = X1
| ~ element(X1,n)
| ~ element(X1,X2)
| ~ element(X2,X1) ),
c_13 ).
cnf(c_0_40,negated_conjecture,
element(k,n),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_20]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( X1 = k
| element(X1,k)
| X1 != m ),
c_14 ).
cnf(c_0_42,negated_conjecture,
( k = X1
| X1 = n
| ~ element(X1,k)
| ~ element(k,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_20]) ).
cnf(c_0_43,negated_conjecture,
element(m,k),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_41]),c_0_18]) ).
cnf(c_0_44,negated_conjecture,
element(k,m),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_40])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_18]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:31:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.JewRBGVUTh/E---3.1_14965.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_1 with pid 15094 completed with status 0
% 0.20/0.50 # Result found by new_bool_1
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSF-FFSF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 15100 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSF-FFSF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 16
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 16
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 16
% 0.20/0.50 # Processed clauses : 54
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 7
% 0.20/0.50 # ...remaining for further processing : 47
% 0.20/0.50 # Other redundant clauses eliminated : 2
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 3
% 0.20/0.50 # Backward-rewritten : 5
% 0.20/0.50 # Generated clauses : 50
% 0.20/0.50 # ...of the previous two non-redundant : 36
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 42
% 0.20/0.50 # Factorizations : 6
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 2
% 0.20/0.50 # Total rewrite steps : 23
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 21
% 0.20/0.50 # Positive orientable unit clauses : 6
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 3
% 0.20/0.50 # Non-unit-clauses : 12
% 0.20/0.50 # Current number of unprocessed clauses: 8
% 0.20/0.50 # ...number of literals in the above : 42
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 24
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 36
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 26
% 0.20/0.50 # Non-unit clause-clause subsumptions : 5
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1096
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1680 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------