TSTP Solution File: SET240-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET240-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:58:07 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 2 equ; 10 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 : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 31 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
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(prove_restriction_alternate_defn3_1,negated_conjecture,
member(ordered_pair(u,v),restrict(xr,x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_restriction_alternate_defn3_1) ).
cnf(prove_restriction_alternate_defn3_2,negated_conjecture,
~ member(u,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_restriction_alternate_defn3_2) ).
cnf(c_0_5,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_6,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_5 ).
cnf(c_0_7,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_8,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product1]) ).
cnf(c_0_9,plain,
( member(X1,cross_product(X2,X3))
| ~ member(X1,restrict(X4,X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
member(ordered_pair(u,v),restrict(xr,x,y)),
prove_restriction_alternate_defn3_1 ).
cnf(c_0_11,negated_conjecture,
~ member(u,x),
inference(fof_simplification,[status(thm)],[prove_restriction_alternate_defn3_2]) ).
cnf(c_0_12,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
member(ordered_pair(u,v),cross_product(x,y)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ member(u,x),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET240-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 12:20:38 EDT 2024
% 0.12/0.33 % 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/benchmark/theBenchmark.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_3 with pid 14429 completed with status 0
% 0.19/0.51 # Result found by new_bool_3
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 14432 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.19/0.51 # Preprocessing time : 0.004 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 114
% 0.19/0.51 # Removed by relevancy pruning/SinE : 79
% 0.19/0.51 # Initial clauses : 35
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 35
% 0.19/0.51 # Processed clauses : 100
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 5
% 0.19/0.51 # ...remaining for further processing : 95
% 0.19/0.51 # Other redundant clauses eliminated : 2
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 0
% 0.19/0.51 # Generated clauses : 84
% 0.19/0.51 # ...of the previous two non-redundant : 74
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 82
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 2
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 4
% 0.19/0.51 # ...of those cached : 0
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 59
% 0.19/0.51 # Positive orientable unit clauses : 11
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 47
% 0.19/0.51 # Current number of unprocessed clauses: 42
% 0.19/0.51 # ...number of literals in the above : 115
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 34
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 438
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 391
% 0.19/0.51 # Non-unit clause-clause subsumptions : 5
% 0.19/0.51 # Unit Clause-clause subsumption calls : 4
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 2
% 0.19/0.51 # BW rewrite match successes : 0
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 3081
% 0.19/0.51 # Search garbage collected termcells : 429
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.014 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.018 s
% 0.19/0.51 # Maximum resident set size: 1848 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.017 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.024 s
% 0.19/0.51 # Maximum resident set size: 1804 pages
% 0.19/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------