TSTP Solution File: SET236-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET236-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:18:57 EDT 2023
% Result : Unsatisfiable 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 8 unt; 2 nHn; 17 RR)
% Number of literals : 32 ( 3 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 22 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.3SlNlKjSW1/E---3.1_31878.p',subclass_members) ).
cnf(prove_cross_product_property11_1,negated_conjecture,
subclass(x,cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/tmp/tmp.3SlNlKjSW1/E---3.1_31878.p',prove_cross_product_property11_1) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.3SlNlKjSW1/E---3.1_31878.p',cartesian_product4) ).
cnf(prove_cross_product_property11_2,negated_conjecture,
member(ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y))),y),
file('/export/starexec/sandbox/tmp/tmp.3SlNlKjSW1/E---3.1_31878.p',prove_cross_product_property11_2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.3SlNlKjSW1/E---3.1_31878.p',not_subclass_members2) ).
cnf(prove_cross_product_property11_3,negated_conjecture,
~ subclass(x,y),
file('/export/starexec/sandbox/tmp/tmp.3SlNlKjSW1/E---3.1_31878.p',prove_cross_product_property11_3) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.3SlNlKjSW1/E---3.1_31878.p',not_subclass_members1) ).
cnf(c_0_7,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_8,negated_conjecture,
subclass(x,cross_product(universal_class,universal_class)),
prove_cross_product_property11_1 ).
cnf(c_0_9,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_10,negated_conjecture,
( member(X1,cross_product(universal_class,universal_class))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
member(ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y))),y),
prove_cross_product_property11_2 ).
cnf(c_0_12,negated_conjecture,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_14,negated_conjecture,
( member(not_subclass_element(x,y),y)
| ~ member(not_subclass_element(x,y),x) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ subclass(x,y),
prove_cross_product_property11_3 ).
cnf(c_0_16,negated_conjecture,
~ member(not_subclass_element(x,y),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET236-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 17:51:35 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 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.3SlNlKjSW1/E---3.1_31878.p
% 0.21/0.48 # Version: 3.1pre001
% 0.21/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # new_bool_3 with pid 32007 completed with status 0
% 0.21/0.48 # Result found by new_bool_3
% 0.21/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGUSF-FFSF21-MFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # SAT001_MinMin_p005000_rr_RG with pid 32016 completed with status 0
% 0.21/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGUSF-FFSF21-MFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Unsatisfiable
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 115
% 0.21/0.48 # Removed by relevancy pruning/SinE : 101
% 0.21/0.48 # Initial clauses : 14
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 14
% 0.21/0.48 # Processed clauses : 46
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 3
% 0.21/0.48 # ...remaining for further processing : 43
% 0.21/0.48 # Other redundant clauses eliminated : 2
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 1
% 0.21/0.48 # Backward-rewritten : 0
% 0.21/0.48 # Generated clauses : 45
% 0.21/0.48 # ...of the previous two non-redundant : 36
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 43
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 2
% 0.21/0.48 # Total rewrite steps : 5
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 27
% 0.21/0.48 # Positive orientable unit clauses : 5
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 2
% 0.21/0.48 # Non-unit-clauses : 20
% 0.21/0.48 # Current number of unprocessed clauses: 17
% 0.21/0.48 # ...number of literals in the above : 47
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 14
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 30
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 30
% 0.21/0.48 # Non-unit clause-clause subsumptions : 3
% 0.21/0.48 # Unit Clause-clause subsumption calls : 5
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 6
% 0.21/0.48 # BW rewrite match successes : 0
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 1695
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.003 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.004 s
% 0.21/0.48 # Maximum resident set size: 1880 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.006 s
% 0.21/0.48 # System time : 0.003 s
% 0.21/0.48 # Total time : 0.009 s
% 0.21/0.48 # Maximum resident set size: 1768 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------