TSTP Solution File: SET232-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET232-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:53:42 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 7 unt; 5 nHn; 14 RR)
% Number of literals : 30 ( 4 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(prove_cross_product_property7_2,negated_conjecture,
~ member(first(not_subclass_element(cross_product(x,y),z)),x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cross_product_property7_2) ).
cnf(prove_cross_product_property7_1,negated_conjecture,
~ subclass(cross_product(x,y),z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cross_product_property7_1) ).
cnf(c_0_5,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(fof_simplification,[status(thm)],[cartesian_product4]) ).
cnf(c_0_6,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product1]) ).
cnf(c_0_7,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
c_0_5 ).
cnf(c_0_8,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_9,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_6 ).
cnf(c_0_10,plain,
( ordered_pair(first(not_subclass_element(cross_product(X1,X2),X3)),second(not_subclass_element(cross_product(X1,X2),X3))) = not_subclass_element(cross_product(X1,X2),X3)
| subclass(cross_product(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ member(first(not_subclass_element(cross_product(x,y),z)),x),
inference(fof_simplification,[status(thm)],[prove_cross_product_property7_2]) ).
cnf(c_0_12,plain,
( member(first(not_subclass_element(cross_product(X1,X2),X3)),X4)
| subclass(cross_product(X1,X2),X3)
| ~ member(not_subclass_element(cross_product(X1,X2),X3),cross_product(X4,X5)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ subclass(cross_product(x,y),z),
inference(fof_simplification,[status(thm)],[prove_cross_product_property7_1]) ).
cnf(c_0_14,negated_conjecture,
~ member(first(not_subclass_element(cross_product(x,y),z)),x),
c_0_11 ).
cnf(c_0_15,plain,
( member(first(not_subclass_element(cross_product(X1,X2),X3)),X1)
| subclass(cross_product(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
~ subclass(cross_product(x,y),z),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET232-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 12:00:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 11734 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSS-FFSF21-MFFFFFNN
% 0.20/0.52 # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 11737 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSS-FFSF21-MFFFFFNN
% 0.20/0.52 # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 114
% 0.20/0.52 # Removed by relevancy pruning/SinE : 97
% 0.20/0.52 # Initial clauses : 17
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 17
% 0.20/0.52 # Processed clauses : 58
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 5
% 0.20/0.52 # ...remaining for further processing : 53
% 0.20/0.52 # Other redundant clauses eliminated : 2
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 76
% 0.20/0.52 # ...of the previous two non-redundant : 67
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 74
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 2
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 4
% 0.20/0.52 # ...of those cached : 1
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 35
% 0.20/0.52 # Positive orientable unit clauses : 4
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 2
% 0.20/0.52 # Non-unit-clauses : 29
% 0.20/0.52 # Current number of unprocessed clauses: 31
% 0.20/0.52 # ...number of literals in the above : 126
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 16
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 163
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 130
% 0.20/0.52 # Non-unit clause-clause subsumptions : 5
% 0.20/0.52 # Unit Clause-clause subsumption calls : 0
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 2
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 2652
% 0.20/0.52 # Search garbage collected termcells : 478
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.008 s
% 0.20/0.52 # System time : 0.001 s
% 0.20/0.52 # Total time : 0.009 s
% 0.20/0.52 # Maximum resident set size: 1904 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.011 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.014 s
% 0.20/0.52 # Maximum resident set size: 1804 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------