TSTP Solution File: SET833-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET833-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Tue May 21 02:56:10 EDT 2024
% Result : Unsatisfiable 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(v_Z,v_V,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_x,v_V,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(v_x,v_Z,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_4,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_5,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
c_0_4 ).
cnf(c_0_6,negated_conjecture,
c_lessequals(v_Z,v_V,tc_set(t_a)),
cls_conjecture_1 ).
cnf(c_0_7,negated_conjecture,
~ c_in(v_x,v_V,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_8,negated_conjecture,
( c_in(X1,v_V,t_a)
| ~ c_in(X1,v_Z,t_a) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
c_in(v_x,v_Z,t_a),
cls_conjecture_2 ).
cnf(c_0_10,negated_conjecture,
~ c_in(v_x,v_V,t_a),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET833-1 : TPTP v8.2.0. Released v3.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n019.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 12:47:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.22/0.47 Running first-order theorem proving
% 0.22/0.47 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/benchmark/theBenchmark.p
% 0.22/0.53 # Version: 3.1.0
% 0.22/0.53 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_3 with pid 12960 completed with status 0
% 0.22/0.53 # Result found by new_bool_3
% 0.22/0.53 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.22/0.53 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 12963 completed with status 0
% 0.22/0.53 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.22/0.53 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.22/0.53 # Preprocessing time : 0.003 s
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Unsatisfiable
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 1361
% 0.22/0.53 # Removed by relevancy pruning/SinE : 977
% 0.22/0.53 # Initial clauses : 384
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 384
% 0.22/0.53 # Processed clauses : 392
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 4
% 0.22/0.53 # ...remaining for further processing : 388
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 2
% 0.22/0.53 # Backward-rewritten : 2
% 0.22/0.53 # Generated clauses : 144
% 0.22/0.53 # ...of the previous two non-redundant : 90
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 141
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 3
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 54
% 0.22/0.53 # ...of those cached : 27
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 384
% 0.22/0.53 # Positive orientable unit clauses : 37
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 7
% 0.22/0.53 # Non-unit-clauses : 340
% 0.22/0.53 # Current number of unprocessed clauses: 82
% 0.22/0.53 # ...number of literals in the above : 155
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 4
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 21421
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 21412
% 0.22/0.53 # Non-unit clause-clause subsumptions : 5
% 0.22/0.53 # Unit Clause-clause subsumption calls : 22
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 8
% 0.22/0.53 # BW rewrite match successes : 2
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 14267
% 0.22/0.53 # Search garbage collected termcells : 2479
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.023 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.027 s
% 0.22/0.53 # Maximum resident set size: 3004 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.044 s
% 0.22/0.53 # System time : 0.006 s
% 0.22/0.53 # Total time : 0.050 s
% 0.22/0.53 # Maximum resident set size: 2408 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------