TSTP Solution File: SYN131-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN131-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:52 EDT 2023
% Result : Unsatisfiable 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 5 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(axiom_8,axiom,
m0(e,d,e),
file('/export/starexec/sandbox/tmp/tmp.fwWDZfvZIe/E---3.1_8555.p',axiom_8) ).
cnf(prove_this,negated_conjecture,
~ m0(X1,X2,e),
file('/export/starexec/sandbox/tmp/tmp.fwWDZfvZIe/E---3.1_8555.p',prove_this) ).
cnf(c_0_2,axiom,
m0(e,d,e),
axiom_8 ).
cnf(c_0_3,negated_conjecture,
~ m0(X1,X2,e),
prove_this ).
cnf(c_0_4,plain,
$false,
inference(sr,[status(thm)],[c_0_2,c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : SYN131-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n003.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 18:51:03 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.fwWDZfvZIe/E---3.1_8555.p
% 0.22/0.55 # Version: 3.1pre001
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # new_bool_3 with pid 8699 completed with status 0
% 0.22/0.55 # Result found by new_bool_3
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.55 # SAT001_MinMin_p005000_rr_RG with pid 8706 completed with status 0
% 0.22/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.55 # Preprocessing time : 0.004 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Unsatisfiable
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 369
% 0.22/0.55 # Removed by relevancy pruning/SinE : 160
% 0.22/0.55 # Initial clauses : 209
% 0.22/0.55 # Removed in clause preprocessing : 5
% 0.22/0.55 # Initial clauses in saturation : 204
% 0.22/0.55 # Processed clauses : 8
% 0.22/0.55 # ...of these trivial : 0
% 0.22/0.55 # ...subsumed : 0
% 0.22/0.55 # ...remaining for further processing : 8
% 0.22/0.55 # Other redundant clauses eliminated : 0
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 0
% 0.22/0.55 # Backward-rewritten : 0
% 0.22/0.55 # Generated clauses : 2
% 0.22/0.55 # ...of the previous two non-redundant : 0
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 0
% 0.22/0.55 # Paramodulations : 0
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 0
% 0.22/0.55 # Total rewrite steps : 0
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 6
% 0.22/0.55 # Positive orientable unit clauses : 5
% 0.22/0.55 # Positive unorientable unit clauses: 0
% 0.22/0.55 # Negative unit clauses : 1
% 0.22/0.55 # Non-unit-clauses : 0
% 0.22/0.55 # Current number of unprocessed clauses: 196
% 0.22/0.55 # ...number of literals in the above : 521
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 2
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.55 # Non-unit clause-clause subsumptions : 0
% 0.22/0.55 # Unit Clause-clause subsumption calls : 0
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 0
% 0.22/0.55 # BW rewrite match successes : 0
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 5242
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.007 s
% 0.22/0.55 # System time : 0.003 s
% 0.22/0.55 # Total time : 0.010 s
% 0.22/0.55 # Maximum resident set size: 2304 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.013 s
% 0.22/0.55 # System time : 0.005 s
% 0.22/0.55 # Total time : 0.019 s
% 0.22/0.55 # Maximum resident set size: 1996 pages
% 0.22/0.55 % E---3.1 exiting
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------