TSTP Solution File: SET116-7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET116-7 : TPTP v8.2.0. Bugfixed v7.3.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:53:16 EDT 2024
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 9 unt; 4 nHn; 9 RR)
% Number of literals : 17 ( 16 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_unique_1st_and_2nd_in_pair_of_non_sets4_1,negated_conjecture,
ordered_pair(first(x),second(x)) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets4_1) ).
cnf(existence_of_1st_and_2nd_4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| first(X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_4) ).
cnf(prove_unique_2nd_in_pair_of_non_sets,negated_conjecture,
second(x) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_2nd_in_pair_of_non_sets) ).
cnf(existence_of_1st_and_2nd_5,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| second(X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_5) ).
cnf(c_0_4,negated_conjecture,
ordered_pair(first(x),second(x)) != x,
inference(fof_simplification,[status(thm)],[prove_unique_1st_and_2nd_in_pair_of_non_sets4_1]) ).
cnf(c_0_5,negated_conjecture,
ordered_pair(first(x),second(x)) != x,
c_0_4 ).
cnf(c_0_6,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| first(X1) = X1 ),
existence_of_1st_and_2nd_4 ).
cnf(c_0_7,negated_conjecture,
first(x) = x,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
second(x) != x,
inference(fof_simplification,[status(thm)],[prove_unique_2nd_in_pair_of_non_sets]) ).
cnf(c_0_9,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| second(X1) = X1 ),
existence_of_1st_and_2nd_5 ).
cnf(c_0_10,negated_conjecture,
ordered_pair(x,second(x)) != x,
inference(rw,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
second(x) != x,
c_0_8 ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET116-7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 12:40:08 EDT 2024
% 0.21/0.35 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # sh5l with pid 22332 completed with status 0
% 0.21/0.54 # Result found by sh5l
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.21/0.54 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.21/0.54 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 22335 completed with status 0
% 0.21/0.54 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.21/0.54 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.21/0.54 # Preprocessing time : 0.003 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 161
% 0.21/0.54 # Removed by relevancy pruning/SinE : 11
% 0.21/0.54 # Initial clauses : 150
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 150
% 0.21/0.54 # Processed clauses : 179
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 2
% 0.21/0.54 # ...remaining for further processing : 177
% 0.21/0.54 # Other redundant clauses eliminated : 3
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 7
% 0.21/0.54 # ...of the previous two non-redundant : 5
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 4
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 3
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 9
% 0.21/0.54 # ...of those cached : 2
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 26
% 0.21/0.54 # Positive orientable unit clauses : 10
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 4
% 0.21/0.54 # Non-unit-clauses : 12
% 0.21/0.54 # Current number of unprocessed clauses: 122
% 0.21/0.54 # ...number of literals in the above : 263
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 148
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 1911
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 1557
% 0.21/0.54 # Non-unit clause-clause subsumptions : 2
% 0.21/0.54 # Unit Clause-clause subsumption calls : 251
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 15
% 0.21/0.54 # BW rewrite match successes : 11
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 4691
% 0.21/0.54 # Search garbage collected termcells : 283
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.012 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.018 s
% 0.21/0.54 # Maximum resident set size: 2052 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.015 s
% 0.21/0.54 # System time : 0.009 s
% 0.21/0.54 # Total time : 0.025 s
% 0.21/0.54 # Maximum resident set size: 1820 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------