TSTP Solution File: SYN196-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN196-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:29:33 EDT 2023
% Result : Unsatisfiable 0.40s 0.58s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 19 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 11 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QFYlD2OHm4/E---3.1_27694.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.QFYlD2OHm4/E---3.1_27694.p',axiom_14) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.QFYlD2OHm4/E---3.1_27694.p',rule_126) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox2/tmp/tmp.QFYlD2OHm4/E---3.1_27694.p',axiom_36) ).
cnf(prove_this,negated_conjecture,
~ s1(a),
file('/export/starexec/sandbox2/tmp/tmp.QFYlD2OHm4/E---3.1_27694.p',prove_this) ).
cnf(c_0_5,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_6,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_7,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_8,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_9,negated_conjecture,
~ s1(a),
prove_this ).
cnf(c_0_10,plain,
s1(b),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,plain,
~ s1(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN196-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:59:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.53 Running first-order model finding
% 0.21/0.53 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.QFYlD2OHm4/E---3.1_27694.p
% 0.40/0.58 # Version: 3.1pre001
% 0.40/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.58 # Starting sh5l with 300s (1) cores
% 0.40/0.58 # new_bool_3 with pid 27809 completed with status 0
% 0.40/0.58 # Result found by new_bool_3
% 0.40/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.40/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.40/0.58 # SAT001_MinMin_p005000_rr_RG with pid 27812 completed with status 0
% 0.40/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.40/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.40/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.40/0.58 # Preprocessing time : 0.005 s
% 0.40/0.58 # Presaturation interreduction done
% 0.40/0.58
% 0.40/0.58 # Proof found!
% 0.40/0.58 # SZS status Unsatisfiable
% 0.40/0.58 # SZS output start CNFRefutation
% See solution above
% 0.40/0.58 # Parsed axioms : 369
% 0.40/0.58 # Removed by relevancy pruning/SinE : 48
% 0.40/0.58 # Initial clauses : 321
% 0.40/0.58 # Removed in clause preprocessing : 5
% 0.40/0.58 # Initial clauses in saturation : 316
% 0.40/0.58 # Processed clauses : 384
% 0.40/0.58 # ...of these trivial : 9
% 0.40/0.58 # ...subsumed : 22
% 0.40/0.58 # ...remaining for further processing : 353
% 0.40/0.58 # Other redundant clauses eliminated : 0
% 0.40/0.58 # Clauses deleted for lack of memory : 0
% 0.40/0.58 # Backward-subsumed : 7
% 0.40/0.58 # Backward-rewritten : 4
% 0.40/0.58 # Generated clauses : 27
% 0.40/0.58 # ...of the previous two non-redundant : 22
% 0.40/0.58 # ...aggressively subsumed : 0
% 0.40/0.58 # Contextual simplify-reflections : 1
% 0.40/0.58 # Paramodulations : 26
% 0.40/0.58 # Factorizations : 0
% 0.40/0.58 # NegExts : 0
% 0.40/0.58 # Equation resolutions : 0
% 0.40/0.58 # Total rewrite steps : 78
% 0.40/0.58 # Propositional unsat checks : 0
% 0.40/0.58 # Propositional check models : 0
% 0.40/0.58 # Propositional check unsatisfiable : 0
% 0.40/0.58 # Propositional clauses : 0
% 0.40/0.58 # Propositional clauses after purity: 0
% 0.40/0.58 # Propositional unsat core size : 0
% 0.40/0.58 # Propositional preprocessing time : 0.000
% 0.40/0.58 # Propositional encoding time : 0.000
% 0.40/0.58 # Propositional solver time : 0.000
% 0.40/0.58 # Success case prop preproc time : 0.000
% 0.40/0.58 # Success case prop encoding time : 0.000
% 0.40/0.58 # Success case prop solver time : 0.000
% 0.40/0.58 # Current number of processed clauses : 60
% 0.40/0.58 # Positive orientable unit clauses : 46
% 0.40/0.58 # Positive unorientable unit clauses: 0
% 0.40/0.58 # Negative unit clauses : 1
% 0.40/0.58 # Non-unit-clauses : 13
% 0.40/0.58 # Current number of unprocessed clauses: 235
% 0.40/0.58 # ...number of literals in the above : 688
% 0.40/0.58 # Current number of archived formulas : 0
% 0.40/0.58 # Current number of archived clauses : 293
% 0.40/0.58 # Clause-clause subsumption calls (NU) : 16595
% 0.40/0.58 # Rec. Clause-clause subsumption calls : 11019
% 0.40/0.58 # Non-unit clause-clause subsumptions : 26
% 0.40/0.58 # Unit Clause-clause subsumption calls : 42
% 0.40/0.58 # Rewrite failures with RHS unbound : 0
% 0.40/0.58 # BW rewrite match attempts : 5
% 0.40/0.58 # BW rewrite match successes : 4
% 0.40/0.58 # Condensation attempts : 0
% 0.40/0.58 # Condensation successes : 0
% 0.40/0.58 # Termbank termtop insertions : 8702
% 0.40/0.58
% 0.40/0.58 # -------------------------------------------------
% 0.40/0.58 # User time : 0.026 s
% 0.40/0.58 # System time : 0.009 s
% 0.40/0.58 # Total time : 0.035 s
% 0.40/0.58 # Maximum resident set size: 2456 pages
% 0.40/0.58
% 0.40/0.58 # -------------------------------------------------
% 0.40/0.58 # User time : 0.033 s
% 0.40/0.58 # System time : 0.011 s
% 0.40/0.58 # Total time : 0.044 s
% 0.40/0.58 # Maximum resident set size: 2000 pages
% 0.40/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------