TSTP Solution File: SET238-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET238-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:22:31 EDT 2023
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 5 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 22 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.wrt8Hanzwe/E---3.1_4687.p',intersection2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.wrt8Hanzwe/E---3.1_4687.p',restriction1) ).
cnf(prove_corollary_to_restriction_alternate_defn1_1,negated_conjecture,
member(z,restrict(xr,x,y)),
file('/export/starexec/sandbox/tmp/tmp.wrt8Hanzwe/E---3.1_4687.p',prove_corollary_to_restriction_alternate_defn1_1) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.wrt8Hanzwe/E---3.1_4687.p',cartesian_product4) ).
cnf(prove_corollary_to_restriction_alternate_defn1_2,negated_conjecture,
~ member(ordered_pair(first(z),second(z)),restrict(xr,x,y)),
file('/export/starexec/sandbox/tmp/tmp.wrt8Hanzwe/E---3.1_4687.p',prove_corollary_to_restriction_alternate_defn1_2) ).
cnf(c_0_5,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_6,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_7,plain,
( member(X1,cross_product(X2,X3))
| ~ member(X1,restrict(X4,X2,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
member(z,restrict(xr,x,y)),
prove_corollary_to_restriction_alternate_defn1_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(z,cross_product(x,y)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ member(ordered_pair(first(z),second(z)),restrict(xr,x,y)),
prove_corollary_to_restriction_alternate_defn1_2 ).
cnf(c_0_12,negated_conjecture,
ordered_pair(first(z),second(z)) = z,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET238-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n014.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 17:31:49 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.wrt8Hanzwe/E---3.1_4687.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 4765 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.19/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 4768 completed with status 0
% 0.19/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.004 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 114
% 0.19/0.48 # Removed by relevancy pruning/SinE : 78
% 0.19/0.48 # Initial clauses : 36
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 36
% 0.19/0.48 # Processed clauses : 90
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 2
% 0.19/0.48 # ...remaining for further processing : 88
% 0.19/0.48 # Other redundant clauses eliminated : 2
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 1
% 0.19/0.48 # Generated clauses : 70
% 0.19/0.48 # ...of the previous two non-redundant : 54
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 68
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 2
% 0.19/0.48 # Total rewrite steps : 8
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 50
% 0.19/0.48 # Positive orientable unit clauses : 12
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 0
% 0.19/0.48 # Non-unit-clauses : 38
% 0.19/0.48 # Current number of unprocessed clauses: 35
% 0.19/0.48 # ...number of literals in the above : 105
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 36
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 317
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 288
% 0.19/0.48 # Non-unit clause-clause subsumptions : 2
% 0.19/0.48 # Unit Clause-clause subsumption calls : 19
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 3
% 0.19/0.48 # BW rewrite match successes : 1
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 2658
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.005 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1820 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.008 s
% 0.19/0.48 # System time : 0.006 s
% 0.19/0.48 # Total time : 0.013 s
% 0.19/0.48 # Maximum resident set size: 1776 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------