TSTP Solution File: COL085-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL085-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:28:16 EDT 2024
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 4 RR)
% Number of literals : 4 ( 3 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 6 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_happiness_1,negated_conjecture,
response(a,X1) != X2,
file('/export/starexec/sandbox2/tmp/tmp.ym675r8Lr1/E---3.1_31074.p',prove_happiness_1) ).
cnf(c_0_1,negated_conjecture,
response(a,X1) != X2,
inference(fof_simplification,[status(thm)],[prove_happiness_1]) ).
cnf(c_0_2,negated_conjecture,
response(a,X1) != X2,
c_0_1 ).
cnf(c_0_3,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_2]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : COL085-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 11:57:12 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/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.ym675r8Lr1/E---3.1_31074.p
% 0.16/0.44 # Version: 3.1.0
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # new_bool_3 with pid 31157 completed with status 0
% 0.16/0.44 # Result found by new_bool_3
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 31161 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Unsatisfiable
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 2
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 2
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 2
% 0.16/0.44 # Processed clauses : 2
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 2
% 0.16/0.44 # Other redundant clauses eliminated : 1
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 1
% 0.16/0.44 # ...of the previous two non-redundant : 0
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 0
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 1
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 0
% 0.16/0.44 # ...of those cached : 0
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 1
% 0.16/0.44 # Positive orientable unit clauses : 1
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 0
% 0.16/0.44 # Non-unit-clauses : 0
% 0.16/0.44 # Current number of unprocessed clauses: 0
% 0.16/0.44 # ...number of literals in the above : 0
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 0
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 0
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 19
% 0.16/0.44 # Search garbage collected termcells : 2
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.002 s
% 0.16/0.44 # System time : 0.000 s
% 0.16/0.44 # Total time : 0.002 s
% 0.16/0.44 # Maximum resident set size: 1616 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.002 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.005 s
% 0.16/0.44 # Maximum resident set size: 1680 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------