TSTP Solution File: SET013-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET013-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:52:22 EDT 2024
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 6 unt; 4 nHn; 21 RR)
% Number of literals : 55 ( 0 equ; 27 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subsets_axiom2,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
cnf(member_of_both_is_member_of_intersection,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_both_is_member_of_intersection) ).
cnf(member_of_intersection_is_member_of_set1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_intersection_is_member_of_set1) ).
cnf(subsets_axiom1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).
cnf(member_of_intersection_is_member_of_set2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_intersection_is_member_of_set2) ).
cnf(subsets_are_set_equal_sets,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_are_set_equal_sets) ).
cnf(prove_commutativity,negated_conjecture,
~ equal_sets(intersection(as,bs),intersection(bs,as)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_commutativity) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).
cnf(c_0_8,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[member_of_both_is_member_of_intersection]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set1]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_7 ).
cnf(c_0_11,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_8 ).
cnf(c_0_12,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_9 ).
cnf(c_0_13,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
subsets_axiom1 ).
cnf(c_0_14,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set2]) ).
cnf(c_0_15,plain,
( subset(X1,intersection(X2,X3))
| ~ member(member_of_1_not_of_2(X1,intersection(X2,X3)),X3)
| ~ member(member_of_1_not_of_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( subset(intersection(X1,X2),X3)
| member(member_of_1_not_of_2(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_14 ).
cnf(c_0_18,plain,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(fof_simplification,[status(thm)],[subsets_are_set_equal_sets]) ).
cnf(c_0_19,plain,
( subset(intersection(X1,X2),intersection(X3,X1))
| ~ member(member_of_1_not_of_2(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( subset(intersection(X1,X2),X3)
| member(member_of_1_not_of_2(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
~ equal_sets(intersection(as,bs),intersection(bs,as)),
inference(fof_simplification,[status(thm)],[prove_commutativity]) ).
cnf(c_0_22,plain,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_18 ).
cnf(c_0_23,plain,
subset(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ equal_sets(intersection(as,bs),intersection(bs,as)),
c_0_21 ).
cnf(c_0_25,plain,
equal_sets(intersection(X1,X2),intersection(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET013-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 12:08:22 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # sh5l with pid 19726 completed with status 0
% 0.20/0.54 # Result found by sh5l
% 0.20/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.20/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.54 # SAT001_MinMin_p005000_rr_RG with pid 19733 completed with status 0
% 0.20/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.20/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.54 # Preprocessing time : 0.001 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Unsatisfiable
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 22
% 0.20/0.54 # Removed by relevancy pruning/SinE : 6
% 0.20/0.54 # Initial clauses : 16
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 16
% 0.20/0.54 # Processed clauses : 662
% 0.20/0.54 # ...of these trivial : 19
% 0.20/0.54 # ...subsumed : 399
% 0.20/0.54 # ...remaining for further processing : 244
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 0
% 0.20/0.54 # Backward-rewritten : 1
% 0.20/0.54 # Generated clauses : 3736
% 0.20/0.54 # ...of the previous two non-redundant : 3542
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 0
% 0.20/0.54 # Paramodulations : 3694
% 0.20/0.54 # Factorizations : 42
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 110
% 0.20/0.54 # ...of those cached : 83
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 227
% 0.20/0.54 # Positive orientable unit clauses : 35
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 0
% 0.20/0.54 # Non-unit-clauses : 192
% 0.20/0.54 # Current number of unprocessed clauses: 2912
% 0.20/0.54 # ...number of literals in the above : 7385
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 17
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 9052
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 8109
% 0.20/0.54 # Non-unit clause-clause subsumptions : 399
% 0.20/0.54 # Unit Clause-clause subsumption calls : 279
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 72
% 0.20/0.54 # BW rewrite match successes : 1
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 55141
% 0.20/0.54 # Search garbage collected termcells : 55
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.058 s
% 0.20/0.54 # System time : 0.006 s
% 0.20/0.54 # Total time : 0.064 s
% 0.20/0.54 # Maximum resident set size: 1592 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.059 s
% 0.20/0.54 # System time : 0.008 s
% 0.20/0.54 # Total time : 0.067 s
% 0.20/0.54 # Maximum resident set size: 1712 pages
% 0.20/0.54 % E---3.1 exiting
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------