TSTP Solution File: SYN166-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN166-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:28 EDT 2023
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 14 unt; 0 nHn; 15 RR)
% Number of literals : 32 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_088,axiom,
( p1(a,a,a)
| ~ l0(a) ),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',rule_088) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',axiom_20) ).
cnf(rule_087,axiom,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',rule_087) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',axiom_9) ).
cnf(rule_082,axiom,
( p1(X1,X2,X3)
| ~ m0(X3,X1,X4)
| ~ p1(X3,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',rule_082) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',axiom_12) ).
cnf(prove_this,negated_conjecture,
~ p1(a,b,b),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',prove_this) ).
cnf(axiom_38,axiom,
m0(b,a,a),
file('/export/starexec/sandbox2/tmp/tmp.UbQLhkfIMM/E---3.1_19068.p',axiom_38) ).
cnf(c_0_8,axiom,
( p1(a,a,a)
| ~ l0(a) ),
rule_088 ).
cnf(c_0_9,axiom,
l0(a),
axiom_20 ).
cnf(c_0_10,axiom,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
rule_087 ).
cnf(c_0_11,axiom,
r0(b),
axiom_9 ).
cnf(c_0_12,plain,
p1(a,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_13,axiom,
( p1(X1,X2,X3)
| ~ m0(X3,X1,X4)
| ~ p1(X3,X1,X4) ),
rule_082 ).
cnf(c_0_14,plain,
p1(a,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_16,plain,
p1(b,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
~ p1(a,b,b),
prove_this ).
cnf(c_0_18,plain,
( p1(X1,X2,b)
| ~ m0(b,X1,a) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_19,axiom,
m0(b,a,a),
axiom_38 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN166-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 19:06:37 EDT 2023
% 0.13/0.34 % 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.UbQLhkfIMM/E---3.1_19068.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # new_bool_3 with pid 19146 completed with status 0
% 0.20/0.53 # Result found by new_bool_3
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.53 # SAT001_MinMin_p005000_rr_RG with pid 19149 completed with status 0
% 0.20/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.53 # Preprocessing time : 0.003 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 369
% 0.20/0.53 # Removed by relevancy pruning/SinE : 160
% 0.20/0.53 # Initial clauses : 209
% 0.20/0.53 # Removed in clause preprocessing : 5
% 0.20/0.53 # Initial clauses in saturation : 204
% 0.20/0.53 # Processed clauses : 409
% 0.20/0.53 # ...of these trivial : 21
% 0.20/0.53 # ...subsumed : 15
% 0.20/0.53 # ...remaining for further processing : 373
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 3
% 0.20/0.53 # Backward-rewritten : 25
% 0.20/0.53 # Generated clauses : 260
% 0.20/0.53 # ...of the previous two non-redundant : 161
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 1
% 0.20/0.53 # Paramodulations : 260
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Total rewrite steps : 225
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 168
% 0.20/0.53 # Positive orientable unit clauses : 85
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 3
% 0.20/0.53 # Non-unit-clauses : 80
% 0.20/0.53 # Current number of unprocessed clauses: 132
% 0.20/0.53 # ...number of literals in the above : 309
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 205
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 8359
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 6393
% 0.20/0.53 # Non-unit clause-clause subsumptions : 18
% 0.20/0.53 # Unit Clause-clause subsumption calls : 52
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 53
% 0.20/0.53 # BW rewrite match successes : 21
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 9070
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.023 s
% 0.20/0.53 # System time : 0.006 s
% 0.20/0.53 # Total time : 0.028 s
% 0.20/0.53 # Maximum resident set size: 2296 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.028 s
% 0.20/0.53 # System time : 0.009 s
% 0.20/0.53 # Total time : 0.037 s
% 0.20/0.53 # Maximum resident set size: 1996 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------