TSTP Solution File: SET076-7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET076-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:57:25 EDT 2024
% Result : Unsatisfiable 9.21s 1.64s
% Output : CNFRefutation 9.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 8 unt; 8 nHn; 15 RR)
% Number of literals : 37 ( 10 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(prove_unordered_pair_is_subset_2,negated_conjecture,
member(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unordered_pair_is_subset_2) ).
cnf(prove_unordered_pair_is_subset_3,negated_conjecture,
~ subclass(unordered_pair(x,y),z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unordered_pair_is_subset_3) ).
cnf(prove_unordered_pair_is_subset_1,negated_conjecture,
member(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unordered_pair_is_subset_1) ).
cnf(c_0_6,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_7,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_8,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_6 ).
cnf(c_0_9,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_10,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_7 ).
cnf(c_0_11,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| subclass(unordered_pair(X1,X2),X3)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
member(y,z),
prove_unordered_pair_is_subset_2 ).
cnf(c_0_14,negated_conjecture,
( not_subclass_element(unordered_pair(X1,y),z) = X1
| subclass(unordered_pair(X1,y),z) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
~ subclass(unordered_pair(x,y),z),
inference(fof_simplification,[status(thm)],[prove_unordered_pair_is_subset_3]) ).
cnf(c_0_16,negated_conjecture,
( subclass(unordered_pair(X1,y),z)
| ~ member(X1,z) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
member(x,z),
prove_unordered_pair_is_subset_1 ).
cnf(c_0_18,negated_conjecture,
~ subclass(unordered_pair(x,y),z),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET076-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 13:35:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 9.21/1.64 # Version: 3.1.0
% 9.21/1.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 9.21/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.21/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.21/1.64 # Starting new_bool_3 with 300s (1) cores
% 9.21/1.64 # Starting new_bool_1 with 300s (1) cores
% 9.21/1.64 # Starting sh5l with 300s (1) cores
% 9.21/1.64 # sh5l with pid 15676 completed with status 0
% 9.21/1.64 # Result found by sh5l
% 9.21/1.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 9.21/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.21/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.21/1.64 # Starting new_bool_3 with 300s (1) cores
% 9.21/1.64 # Starting new_bool_1 with 300s (1) cores
% 9.21/1.64 # Starting sh5l with 300s (1) cores
% 9.21/1.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 9.21/1.64 # Search class: FGHSM-FFMM31-MFFFFFNN
% 9.21/1.64 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 9.21/1.64 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 9.21/1.64 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 15679 completed with status 0
% 9.21/1.64 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 9.21/1.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 9.21/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.21/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.21/1.64 # Starting new_bool_3 with 300s (1) cores
% 9.21/1.64 # Starting new_bool_1 with 300s (1) cores
% 9.21/1.64 # Starting sh5l with 300s (1) cores
% 9.21/1.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 9.21/1.64 # Search class: FGHSM-FFMM31-MFFFFFNN
% 9.21/1.64 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 9.21/1.64 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 9.21/1.64 # Preprocessing time : 0.003 s
% 9.21/1.64 # Presaturation interreduction done
% 9.21/1.64
% 9.21/1.64 # Proof found!
% 9.21/1.64 # SZS status Unsatisfiable
% 9.21/1.64 # SZS output start CNFRefutation
% See solution above
% 9.21/1.64 # Parsed axioms : 121
% 9.21/1.64 # Removed by relevancy pruning/SinE : 9
% 9.21/1.64 # Initial clauses : 112
% 9.21/1.64 # Removed in clause preprocessing : 0
% 9.21/1.64 # Initial clauses in saturation : 112
% 9.21/1.64 # Processed clauses : 6946
% 9.21/1.64 # ...of these trivial : 383
% 9.21/1.64 # ...subsumed : 4398
% 9.21/1.64 # ...remaining for further processing : 2165
% 9.21/1.64 # Other redundant clauses eliminated : 8
% 9.21/1.64 # Clauses deleted for lack of memory : 0
% 9.21/1.64 # Backward-subsumed : 12
% 9.21/1.64 # Backward-rewritten : 16
% 9.21/1.64 # Generated clauses : 144050
% 9.21/1.64 # ...of the previous two non-redundant : 118301
% 9.21/1.64 # ...aggressively subsumed : 0
% 9.21/1.64 # Contextual simplify-reflections : 4
% 9.21/1.64 # Paramodulations : 144022
% 9.21/1.64 # Factorizations : 11
% 9.21/1.64 # NegExts : 0
% 9.21/1.64 # Equation resolutions : 17
% 9.21/1.64 # Disequality decompositions : 0
% 9.21/1.64 # Total rewrite steps : 35953
% 9.21/1.64 # ...of those cached : 32718
% 9.21/1.64 # Propositional unsat checks : 0
% 9.21/1.64 # Propositional check models : 0
% 9.21/1.64 # Propositional check unsatisfiable : 0
% 9.21/1.64 # Propositional clauses : 0
% 9.21/1.64 # Propositional clauses after purity: 0
% 9.21/1.64 # Propositional unsat core size : 0
% 9.21/1.64 # Propositional preprocessing time : 0.000
% 9.21/1.64 # Propositional encoding time : 0.000
% 9.21/1.64 # Propositional solver time : 0.000
% 9.21/1.64 # Success case prop preproc time : 0.000
% 9.21/1.64 # Success case prop encoding time : 0.000
% 9.21/1.64 # Success case prop solver time : 0.000
% 9.21/1.64 # Current number of processed clauses : 2026
% 9.21/1.64 # Positive orientable unit clauses : 881
% 9.21/1.64 # Positive unorientable unit clauses: 6
% 9.21/1.64 # Negative unit clauses : 21
% 9.21/1.64 # Non-unit-clauses : 1118
% 9.21/1.64 # Current number of unprocessed clauses: 111457
% 9.21/1.64 # ...number of literals in the above : 218779
% 9.21/1.64 # Current number of archived formulas : 0
% 9.21/1.64 # Current number of archived clauses : 137
% 9.21/1.64 # Clause-clause subsumption calls (NU) : 208022
% 9.21/1.64 # Rec. Clause-clause subsumption calls : 156045
% 9.21/1.64 # Non-unit clause-clause subsumptions : 3849
% 9.21/1.64 # Unit Clause-clause subsumption calls : 25979
% 9.21/1.64 # Rewrite failures with RHS unbound : 15
% 9.21/1.64 # BW rewrite match attempts : 2060
% 9.21/1.64 # BW rewrite match successes : 31
% 9.21/1.64 # Condensation attempts : 0
% 9.21/1.64 # Condensation successes : 0
% 9.21/1.64 # Termbank termtop insertions : 2038822
% 9.21/1.64 # Search garbage collected termcells : 231
% 9.21/1.64
% 9.21/1.64 # -------------------------------------------------
% 9.21/1.64 # User time : 1.080 s
% 9.21/1.64 # System time : 0.057 s
% 9.21/1.64 # Total time : 1.137 s
% 9.21/1.64 # Maximum resident set size: 1892 pages
% 9.21/1.64
% 9.21/1.64 # -------------------------------------------------
% 9.21/1.64 # User time : 1.083 s
% 9.21/1.64 # System time : 0.059 s
% 9.21/1.64 # Total time : 1.142 s
% 9.21/1.64 # Maximum resident set size: 1796 pages
% 9.21/1.64 % E---3.1 exiting
%------------------------------------------------------------------------------