TSTP Solution File: SCT061-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SCT061-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 19:16:30 EDT 2023
% Result : Timeout 0.40s 300.17s
% Output : None
% 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 ( 4 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_A_I1_J_0,axiom,
v_a____ != v_b____,
file('/export/starexec/sandbox2/tmp/tmp.NegOqUoP1v/E---3.1_6599.p',cls_A_I1_J_0) ).
cnf(cls_conjecture_0,negated_conjecture,
v_b____ = v_a____,
file('/export/starexec/sandbox2/tmp/tmp.NegOqUoP1v/E---3.1_6599.p',cls_conjecture_0) ).
cnf(c_0_2,axiom,
v_a____ != v_b____,
cls_A_I1_J_0 ).
cnf(c_0_3,negated_conjecture,
v_b____ = v_a____,
cls_conjecture_0 ).
cnf(c_0_4,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2,c_0_3])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : SCT061-1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.16 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 11:56:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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.NegOqUoP1v/E---3.1_6599.p
% 0.40/300.17 # Version: 3.1pre001
% 0.40/300.17 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.40/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.17 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.40/300.17 # Starting new_bool_3 with 600s (2) cores
% 0.40/300.17 # Starting new_bool_1 with 300s (1) cores
% 0.40/300.17 # Starting sh5l with 300s (1) cores
% 0.40/300.17 # new_bool_3 with pid 6689 completed with status 0
% 0.40/300.17 # Result found by new_bool_3
% 0.40/300.17 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.40/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.17 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.40/300.17 # Starting new_bool_3 with 600s (2) cores
% 0.40/300.17 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/300.17 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.40/300.17 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.40/300.17 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 300s (1) cores
% 0.40/300.17 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S0V with 75s (1) cores
% 0.40/300.17 # G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with pid 6692 completed with status 0
% 0.40/300.17 # Result found by G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V
% 0.40/300.17 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.40/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.17 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.40/300.17 # Starting new_bool_3 with 600s (2) cores
% 0.40/300.17 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/300.17 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.40/300.17 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.40/300.17 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 300s (1) cores
% 0.40/300.17 # Preprocessing time : 0.004 s
% 0.40/300.17
% 0.40/300.17 # Proof found!
% 0.40/300.17 # SZS status Unsatisfiable
% 0.40/300.17 # SZS output start CNFRefutation
% See solution above
% 0.40/300.17 # Parsed axioms : 613
% 0.40/300.17 # Removed by relevancy pruning/SinE : 383
% 0.40/300.17 # Initial clauses : 230
% 0.40/300.17 # Removed in clause preprocessing : 0
% 0.40/300.17 # Initial clauses in saturation : 230
% 0.40/300.17 # Processed clauses : 2
% 0.40/300.17 # ...of these trivial : 0
% 0.40/300.17 # ...subsumed : 0
% 0.40/300.17 # ...remaining for further processing : 1
% 0.40/300.17 # Other redundant clauses eliminated : 0
% 0.40/300.17 # Clauses deleted for lack of memory : 0
% 0.40/300.17 # Backward-subsumed : 0
% 0.40/300.17 # Backward-rewritten : 0
% 0.40/300.17 # Generated clauses : 0
% 0.40/300.17 # ...of the previous two non-redundant : 0
% 0.40/300.17 # ...aggressively subsumed : 0
% 0.40/300.17 # Contextual simplify-reflections : 0
% 0.40/300.17 # Paramodulations : 0
% 0.40/300.17 # Factorizations : 0
% 0.40/300.17 # NegExts : 0
% 0.40/300.17 # Equation resolutions : 0
% 0.40/300.17 # Total rewrite steps : 1
% 0.40/300.17 # Propositional unsat checks : 0
% 0.40/300.17 # Propositional check models : 0
% 0.40/300.17 # Propositional check unsatisfiable : 0
% 0.40/300.17 # Propositional clauses : 0
% 0.40/300.17 # Propositional clauses after purity: 0
% 0.40/300.17 # Propositional unsat core size : 0
% 0.40/300.17 # Propositional preprocessing time : 0.000
% 0.40/300.17 # Propositional encoding time : 0.000
% 0.40/300.17 # Propositional solver time : 0.000
% 0.40/300.17 # Success case prop preproc time : 0.000
% 0.40/300.17 # Success case prop encoding time : 0.000
% 0.40/300.17 # Success case prop solver time : 0.000
% 0.40/300.17 # Current number of processed clauses : 1
% 0.40/300.17 # Positive orientable unit clauses : 1
% 0.40/300.17 # Positive unorientable unit clauses: 0
% 0.40/300.17 # Negative unit clauses : 0
% 0.40/300.17 # Non-unit-clauses : 0
% 0.40/300.17 # Current number of unprocessed clauses: 228
% 0.40/300.17 # ...number of literals in the above : 454
% 0.40/300.17 # Current number of archived formulas : 0
% 0.40/300.17 # Current number of archived clauses : 0
% 0.40/300.17 # Clause-clause subsumption calls (NU) : 0
% 0.40/300.17 # Rec. Clause-clause subsumption calls : 0
% 0.40/300.17 # Non-unit clause-clause subsumptions : 0
% 0.40/300.17 # Unit Clause-clause subsumption calls : 0
% 0.40/300.17 # Rewrite failures with RHS unbound : 0
% 0.40/300.17 # BW rewrite match attempts : 0
% 0.40/300.17 # BW rewrite match successes : 0
% 0.40/300.17 # Condensation attempts : 2
% 0.40/300.17 # Condensation successes : 0
% 0.40/300.17 # Termbank termtop insertions : 10131
% 0.40/300.17
% 0.40/300.17 # -------------------------------------------------
% 0.40/300.17 # User time : 0.008 s
% 0.40/300.17 # System time : 0.002 s
% 0.40/300.17 # Total time : 0.010 s
% 0.40/300.17 # Maximum resident set size: 2624 pages
% 0.40/300.17
% 0.40/300.17 # -------------------------------------------------
% 0.40/300.17 # User time : 0.028 s
% 0.40/300.17 # System time : 0.007 s
% 0.40/300.17 # Total time : 0.034 s
% 0.40/300.17 # Maximum resident set size: 2208 pages
% 0.40/300.17 % E---3.1 exiting
% 0.40/300.17 % E---3.1 exiting
%------------------------------------------------------------------------------