TSTP Solution File: SET024-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET024-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:21:40 EDT 2023
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 6 RR)
% Number of literals : 16 ( 4 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_membership_of_singleton_set,negated_conjecture,
~ member(a,singleton_set(a)),
file('/export/starexec/sandbox2/tmp/tmp.BsHrtHHBVN/E---3.1_9275.p',prove_membership_of_singleton_set) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.BsHrtHHBVN/E---3.1_9275.p',singleton_set) ).
cnf(non_ordered_pair3,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X3 ),
file('/export/starexec/sandbox2/tmp/tmp.BsHrtHHBVN/E---3.1_9275.p',non_ordered_pair3) ).
cnf(a_little_set,hypothesis,
little_set(a),
file('/export/starexec/sandbox2/tmp/tmp.BsHrtHHBVN/E---3.1_9275.p',a_little_set) ).
cnf(c_0_4,negated_conjecture,
~ member(a,singleton_set(a)),
prove_membership_of_singleton_set ).
cnf(c_0_5,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_6,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X3 ),
non_ordered_pair3 ).
cnf(c_0_7,negated_conjecture,
~ member(a,non_ordered_pair(a,a)),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
( member(X1,non_ordered_pair(X2,X1))
| ~ little_set(X1) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
little_set(a),
a_little_set ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SET024-3 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 17:42:36 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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/tmp/tmp.BsHrtHHBVN/E---3.1_9275.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_3 with pid 9353 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGUSS-FFSF21-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # SAT001_MinMin_p005000_rr_RG with pid 9356 completed with status 0
% 0.17/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGUSS-FFSF21-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.005 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 151
% 0.17/0.46 # Removed by relevancy pruning/SinE : 132
% 0.17/0.46 # Initial clauses : 19
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 19
% 0.17/0.46 # Processed clauses : 41
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 1
% 0.17/0.46 # ...remaining for further processing : 40
% 0.17/0.46 # Other redundant clauses eliminated : 5
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 1
% 0.17/0.46 # Generated clauses : 19
% 0.17/0.46 # ...of the previous two non-redundant : 15
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 14
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 5
% 0.17/0.46 # Total rewrite steps : 3
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 15
% 0.17/0.46 # Positive orientable unit clauses : 5
% 0.17/0.46 # Positive unorientable unit clauses: 1
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 8
% 0.17/0.46 # Current number of unprocessed clauses: 12
% 0.17/0.46 # ...number of literals in the above : 36
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 20
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 31
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 23
% 0.17/0.46 # Non-unit clause-clause subsumptions : 1
% 0.17/0.46 # Unit Clause-clause subsumption calls : 0
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 4
% 0.17/0.46 # BW rewrite match successes : 2
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 1717
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.003 s
% 0.17/0.46 # System time : 0.005 s
% 0.17/0.46 # Total time : 0.009 s
% 0.17/0.46 # Maximum resident set size: 1960 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.008 s
% 0.17/0.46 # System time : 0.005 s
% 0.17/0.46 # Total time : 0.013 s
% 0.17/0.46 # Maximum resident set size: 1808 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------