TSTP Solution File: SYN108-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN108-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:13:49 EDT 2023
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 17 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 14 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Vi0c9WYMDH/E---3.1_25745.p',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.Vi0c9WYMDH/E---3.1_25745.p',axiom_19) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Vi0c9WYMDH/E---3.1_25745.p',rule_129) ).
cnf(prove_this,negated_conjecture,
~ k2(a,X1),
file('/export/starexec/sandbox2/tmp/tmp.Vi0c9WYMDH/E---3.1_25745.p',prove_this) ).
cnf(c_0_4,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_5,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_6,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
rule_129 ).
cnf(c_0_7,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5])]) ).
cnf(c_0_8,negated_conjecture,
~ k2(a,X1),
prove_this ).
cnf(c_0_9,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_8,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SYN108-1 : TPTP v8.1.2. Released v1.1.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 18:19:05 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Vi0c9WYMDH/E---3.1_25745.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # new_bool_3 with pid 25825 completed with status 0
% 0.17/0.48 # Result found by new_bool_3
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # SAT001_MinMin_p005000_rr_RG with pid 25829 completed with status 0
% 0.17/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # Preprocessing time : 0.004 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Unsatisfiable
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 369
% 0.17/0.48 # Removed by relevancy pruning/SinE : 41
% 0.17/0.48 # Initial clauses : 328
% 0.17/0.48 # Removed in clause preprocessing : 5
% 0.17/0.48 # Initial clauses in saturation : 323
% 0.17/0.48 # Processed clauses : 444
% 0.17/0.48 # ...of these trivial : 13
% 0.17/0.48 # ...subsumed : 23
% 0.17/0.48 # ...remaining for further processing : 408
% 0.17/0.48 # Other redundant clauses eliminated : 0
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 5
% 0.17/0.48 # Backward-rewritten : 20
% 0.17/0.48 # Generated clauses : 65
% 0.17/0.48 # ...of the previous two non-redundant : 59
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 1
% 0.17/0.48 # Paramodulations : 65
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 0
% 0.17/0.48 # Total rewrite steps : 104
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 96
% 0.17/0.48 # Positive orientable unit clauses : 62
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 1
% 0.17/0.48 # Non-unit-clauses : 33
% 0.17/0.48 # Current number of unprocessed clauses: 222
% 0.17/0.48 # ...number of literals in the above : 659
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 312
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 17673
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 11771
% 0.17/0.48 # Non-unit clause-clause subsumptions : 27
% 0.17/0.48 # Unit Clause-clause subsumption calls : 96
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 23
% 0.17/0.48 # BW rewrite match successes : 19
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 9191
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.025 s
% 0.17/0.48 # System time : 0.005 s
% 0.17/0.48 # Total time : 0.030 s
% 0.17/0.48 # Maximum resident set size: 2472 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.030 s
% 0.17/0.48 # System time : 0.007 s
% 0.17/0.48 # Total time : 0.037 s
% 0.17/0.48 # Maximum resident set size: 2000 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------