TSTP Solution File: SYN132-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN132-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:22 EDT 2023
% Result : Timeout 0.47s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 3 RR)
% Number of literals : 5 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ m0(X1,e,a),
file('/export/starexec/sandbox2/tmp/tmp.XOUgQNsUlc/E---3.1_8513.p',prove_this) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/tmp/tmp.XOUgQNsUlc/E---3.1_8513.p',axiom_12) ).
cnf(c_0_2,negated_conjecture,
~ m0(X1,e,a),
prove_this ).
cnf(c_0_3,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_4,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_2,c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN132-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.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:57:16 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.XOUgQNsUlc/E---3.1_8513.p
% 0.47/300.10 # Version: 3.1pre001
% 0.47/300.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.47/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.47/300.10 # Starting sh5l with 300s (1) cores
% 0.47/300.10 # new_bool_3 with pid 8591 completed with status 0
% 0.47/300.10 # Result found by new_bool_3
% 0.47/300.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.47/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/300.10 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.47/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.47/300.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.47/300.10 # SAT001_MinMin_p005000_rr_RG with pid 8594 completed with status 0
% 0.47/300.10 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.47/300.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.47/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/300.10 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.47/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.47/300.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.47/300.10 # Preprocessing time : 0.004 s
% 0.47/300.10 # Presaturation interreduction done
% 0.47/300.10
% 0.47/300.10 # Proof found!
% 0.47/300.10 # SZS status Unsatisfiable
% 0.47/300.10 # SZS output start CNFRefutation
% See solution above
% 0.47/300.10 # Parsed axioms : 369
% 0.47/300.10 # Removed by relevancy pruning/SinE : 160
% 0.47/300.10 # Initial clauses : 209
% 0.47/300.10 # Removed in clause preprocessing : 5
% 0.47/300.10 # Initial clauses in saturation : 204
% 0.47/300.10 # Processed clauses : 213
% 0.47/300.10 # ...of these trivial : 7
% 0.47/300.10 # ...subsumed : 14
% 0.47/300.10 # ...remaining for further processing : 192
% 0.47/300.10 # Other redundant clauses eliminated : 0
% 0.47/300.10 # Clauses deleted for lack of memory : 0
% 0.47/300.10 # Backward-subsumed : 3
% 0.47/300.10 # Backward-rewritten : 4
% 0.47/300.10 # Generated clauses : 1
% 0.47/300.10 # ...of the previous two non-redundant : 1
% 0.47/300.10 # ...aggressively subsumed : 0
% 0.47/300.10 # Contextual simplify-reflections : 1
% 0.47/300.10 # Paramodulations : 1
% 0.47/300.10 # Factorizations : 0
% 0.47/300.10 # NegExts : 0
% 0.47/300.10 # Equation resolutions : 0
% 0.47/300.10 # Total rewrite steps : 59
% 0.47/300.10 # Propositional unsat checks : 0
% 0.47/300.10 # Propositional check models : 0
% 0.47/300.10 # Propositional check unsatisfiable : 0
% 0.47/300.10 # Propositional clauses : 0
% 0.47/300.10 # Propositional clauses after purity: 0
% 0.47/300.10 # Propositional unsat core size : 0
% 0.47/300.10 # Propositional preprocessing time : 0.000
% 0.47/300.10 # Propositional encoding time : 0.000
% 0.47/300.10 # Propositional solver time : 0.000
% 0.47/300.10 # Success case prop preproc time : 0.000
% 0.47/300.10 # Success case prop encoding time : 0.000
% 0.47/300.10 # Success case prop solver time : 0.000
% 0.47/300.10 # Current number of processed clauses : 8
% 0.47/300.10 # Positive orientable unit clauses : 7
% 0.47/300.10 # Positive unorientable unit clauses: 0
% 0.47/300.10 # Negative unit clauses : 1
% 0.47/300.10 # Non-unit-clauses : 0
% 0.47/300.10 # Current number of unprocessed clauses: 169
% 0.47/300.10 # ...number of literals in the above : 414
% 0.47/300.10 # Current number of archived formulas : 0
% 0.47/300.10 # Current number of archived clauses : 184
% 0.47/300.10 # Clause-clause subsumption calls (NU) : 6256
% 0.47/300.10 # Rec. Clause-clause subsumption calls : 4476
% 0.47/300.10 # Non-unit clause-clause subsumptions : 18
% 0.47/300.10 # Unit Clause-clause subsumption calls : 11
% 0.47/300.10 # Rewrite failures with RHS unbound : 0
% 0.47/300.10 # BW rewrite match attempts : 8
% 0.47/300.10 # BW rewrite match successes : 4
% 0.47/300.10 # Condensation attempts : 0
% 0.47/300.10 # Condensation successes : 0
% 0.47/300.10 # Termbank termtop insertions : 6415
% 0.47/300.10
% 0.47/300.10 # -------------------------------------------------
% 0.47/300.10 # User time : 0.016 s
% 0.47/300.10 # System time : 0.005 s
% 0.47/300.10 # Total time : 0.021 s
% 0.47/300.10 # Maximum resident set size: 2308 pages
% 0.47/300.10
% 0.47/300.10 # -------------------------------------------------
% 0.47/300.10 # User time : 0.022 s
% 0.47/300.10 # System time : 0.008 s
% 0.47/300.10 # Total time : 0.030 s
% 0.47/300.10 # Maximum resident set size: 2000 pages
% 0.47/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------