TSTP Solution File: SET027-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET027-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:03 EDT 2024
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 10 unt; 2 nHn; 19 RR)
% Number of literals : 35 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subset1,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',subset1) ).
cnf(subset3,axiom,
( subset(X1,X2)
| ~ member(f17(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',subset3) ).
cnf(b_subset_c,hypothesis,
subset(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_subset_c) ).
cnf(prove_a_subset_c,negated_conjecture,
~ subset(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_subset_c) ).
cnf(a_subset_b,hypothesis,
subset(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_subset_b) ).
cnf(subset2,axiom,
( subset(X1,X2)
| member(f17(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',subset2) ).
cnf(c_0_6,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subset1]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ member(f17(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[subset3]) ).
cnf(c_0_8,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
c_0_6 ).
cnf(c_0_9,hypothesis,
subset(b,c),
b_subset_c ).
cnf(c_0_10,negated_conjecture,
~ subset(a,c),
inference(fof_simplification,[status(thm)],[prove_a_subset_c]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ member(f17(X1,X2),X2) ),
c_0_7 ).
cnf(c_0_12,hypothesis,
( member(X1,c)
| ~ member(X1,b) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ subset(a,c),
c_0_10 ).
cnf(c_0_14,hypothesis,
( subset(X1,c)
| ~ member(f17(X1,c),b) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
subset(a,b),
a_subset_b ).
cnf(c_0_16,negated_conjecture,
~ member(f17(a,c),b),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
( member(X1,b)
| ~ member(X1,a) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_18,axiom,
( subset(X1,X2)
| member(f17(X1,X2),X1) ),
subset2 ).
cnf(c_0_19,hypothesis,
~ member(f17(a,c),a),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET027-3 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n022.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:17:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 9065 completed with status 0
% 0.20/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSS-FFLS31-MFFFFFNN
% 0.20/0.53 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.53 # Starting new_bool_3 with 216s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S021I with pid 9078 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S021I
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSS-FFLS31-MFFFFFNN
% 0.20/0.53 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.53 # Starting new_bool_3 with 216s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 0.20/0.53 # Preprocessing time : 0.004 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 155
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 155
% 0.20/0.53 # Removed in clause preprocessing : 6
% 0.20/0.53 # Initial clauses in saturation : 149
% 0.20/0.53 # Processed clauses : 237
% 0.20/0.53 # ...of these trivial : 1
% 0.20/0.53 # ...subsumed : 3
% 0.20/0.53 # ...remaining for further processing : 233
% 0.20/0.53 # Other redundant clauses eliminated : 14
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 1
% 0.20/0.53 # Backward-rewritten : 0
% 0.20/0.53 # Generated clauses : 100
% 0.20/0.53 # ...of the previous two non-redundant : 93
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 7
% 0.20/0.53 # Paramodulations : 86
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 14
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 4
% 0.20/0.53 # ...of those cached : 2
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 71
% 0.20/0.53 # Positive orientable unit clauses : 10
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 5
% 0.20/0.53 # Non-unit-clauses : 56
% 0.20/0.53 # Current number of unprocessed clauses: 150
% 0.20/0.53 # ...number of literals in the above : 369
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 154
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 6463
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 2825
% 0.20/0.53 # Non-unit clause-clause subsumptions : 11
% 0.20/0.53 # Unit Clause-clause subsumption calls : 41
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 0
% 0.20/0.53 # BW rewrite match successes : 0
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 6794
% 0.20/0.53 # Search garbage collected termcells : 343
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.021 s
% 0.20/0.53 # System time : 0.010 s
% 0.20/0.53 # Total time : 0.031 s
% 0.20/0.53 # Maximum resident set size: 2096 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.113 s
% 0.20/0.53 # System time : 0.019 s
% 0.20/0.53 # Total time : 0.132 s
% 0.20/0.53 # Maximum resident set size: 1836 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------