TSTP Solution File: CSR031+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR031+4 : TPTP v8.2.0. Released v3.4.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:13:18 EDT 2024
% Result : Theorem 1.50s 1.23s
% Output : CNFRefutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 4 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax3_4028,axiom,
! [X1] :
~ ( collection(X1)
& individual(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_4028) ).
fof(ax3_41385,axiom,
! [X6,X3] :
( disjointwith(X6,X3)
=> collection(X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_41385) ).
fof(query181,conjecture,
~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query181) ).
fof(ax3_20191,axiom,
individual(c_tptptptpcol_16_8398),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_20191) ).
fof(c_0_4,plain,
! [X50] :
( ~ collection(X50)
| ~ individual(X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_4028])])]) ).
fof(c_0_5,plain,
! [X36,X37] :
( ~ disjointwith(X36,X37)
| collection(X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_41385])])]) ).
fof(c_0_6,negated_conjecture,
disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query181])]) ).
cnf(c_0_7,plain,
( ~ collection(X1)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
individual(c_tptptptpcol_16_8398),
inference(split_conjunct,[status(thm)],[ax3_20191]) ).
cnf(c_0_9,plain,
( collection(X1)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
~ collection(c_tptptptpcol_16_8398),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR031+4 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 02:33:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 1.50/1.23 # Version: 3.1.0
% 1.50/1.23 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.50/1.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/1.23 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.50/1.23 # Starting new_bool_3 with 300s (1) cores
% 1.50/1.23 # Starting new_bool_1 with 300s (1) cores
% 1.50/1.23 # Starting sh5l with 300s (1) cores
% 1.50/1.23 # new_bool_1 with pid 5404 completed with status 0
% 1.50/1.23 # Result found by new_bool_1
% 1.50/1.23 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.50/1.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/1.23 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.50/1.23 # Starting new_bool_3 with 300s (1) cores
% 1.50/1.23 # Starting new_bool_1 with 300s (1) cores
% 1.50/1.23 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.50/1.23 # Search class: FHHSM-FFMM33-SFFFFFNN
% 1.50/1.23 # partial match(1): FHHSF-FFMM33-SFFFFFNN
% 1.50/1.23 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.50/1.23 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.50/1.23 # SAT001_MinMin_p005000_rr_RG with pid 5407 completed with status 0
% 1.50/1.23 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.50/1.23 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.50/1.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/1.23 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.50/1.23 # Starting new_bool_3 with 300s (1) cores
% 1.50/1.23 # Starting new_bool_1 with 300s (1) cores
% 1.50/1.23 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.50/1.23 # Search class: FHHSM-FFMM33-SFFFFFNN
% 1.50/1.23 # partial match(1): FHHSF-FFMM33-SFFFFFNN
% 1.50/1.23 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.50/1.23 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.50/1.23 # Preprocessing time : 0.011 s
% 1.50/1.23 # Presaturation interreduction done
% 1.50/1.23
% 1.50/1.23 # Proof found!
% 1.50/1.23 # SZS status Theorem
% 1.50/1.23 # SZS output start CNFRefutation
% See solution above
% 1.50/1.23 # Parsed axioms : 44217
% 1.50/1.23 # Removed by relevancy pruning/SinE : 44138
% 1.50/1.23 # Initial clauses : 79
% 1.50/1.23 # Removed in clause preprocessing : 1
% 1.50/1.23 # Initial clauses in saturation : 78
% 1.50/1.23 # Processed clauses : 96
% 1.50/1.23 # ...of these trivial : 14
% 1.50/1.23 # ...subsumed : 14
% 1.50/1.23 # ...remaining for further processing : 68
% 1.50/1.23 # Other redundant clauses eliminated : 1
% 1.50/1.23 # Clauses deleted for lack of memory : 0
% 1.50/1.23 # Backward-subsumed : 0
% 1.50/1.23 # Backward-rewritten : 0
% 1.50/1.23 # Generated clauses : 8
% 1.50/1.23 # ...of the previous two non-redundant : 5
% 1.50/1.23 # ...aggressively subsumed : 0
% 1.50/1.23 # Contextual simplify-reflections : 0
% 1.50/1.23 # Paramodulations : 7
% 1.50/1.23 # Factorizations : 0
% 1.50/1.23 # NegExts : 0
% 1.50/1.23 # Equation resolutions : 1
% 1.50/1.23 # Disequality decompositions : 0
% 1.50/1.23 # Total rewrite steps : 15
% 1.50/1.23 # ...of those cached : 8
% 1.50/1.23 # Propositional unsat checks : 0
% 1.50/1.23 # Propositional check models : 0
% 1.50/1.23 # Propositional check unsatisfiable : 0
% 1.50/1.23 # Propositional clauses : 0
% 1.50/1.23 # Propositional clauses after purity: 0
% 1.50/1.23 # Propositional unsat core size : 0
% 1.50/1.23 # Propositional preprocessing time : 0.000
% 1.50/1.23 # Propositional encoding time : 0.000
% 1.50/1.23 # Propositional solver time : 0.000
% 1.50/1.23 # Success case prop preproc time : 0.000
% 1.50/1.23 # Success case prop encoding time : 0.000
% 1.50/1.23 # Success case prop solver time : 0.000
% 1.50/1.23 # Current number of processed clauses : 17
% 1.50/1.23 # Positive orientable unit clauses : 10
% 1.50/1.23 # Positive unorientable unit clauses: 0
% 1.50/1.23 # Negative unit clauses : 1
% 1.50/1.23 # Non-unit-clauses : 6
% 1.50/1.23 # Current number of unprocessed clauses: 37
% 1.50/1.23 # ...number of literals in the above : 63
% 1.50/1.23 # Current number of archived formulas : 0
% 1.50/1.23 # Current number of archived clauses : 50
% 1.50/1.23 # Clause-clause subsumption calls (NU) : 68
% 1.50/1.23 # Rec. Clause-clause subsumption calls : 66
% 1.50/1.23 # Non-unit clause-clause subsumptions : 14
% 1.50/1.23 # Unit Clause-clause subsumption calls : 10
% 1.50/1.23 # Rewrite failures with RHS unbound : 0
% 1.50/1.23 # BW rewrite match attempts : 0
% 1.50/1.23 # BW rewrite match successes : 0
% 1.50/1.23 # Condensation attempts : 0
% 1.50/1.23 # Condensation successes : 0
% 1.50/1.23 # Termbank termtop insertions : 294868
% 1.50/1.23 # Search garbage collected termcells : 157894
% 1.50/1.23
% 1.50/1.23 # -------------------------------------------------
% 1.50/1.23 # User time : 0.156 s
% 1.50/1.23 # System time : 0.063 s
% 1.50/1.23 # Total time : 0.219 s
% 1.50/1.23 # Maximum resident set size: 81076 pages
% 1.50/1.23
% 1.50/1.23 # -------------------------------------------------
% 1.50/1.23 # User time : 0.605 s
% 1.50/1.23 # System time : 0.101 s
% 1.50/1.23 # Total time : 0.705 s
% 1.50/1.23 # Maximum resident set size: 33928 pages
% 1.50/1.23 % E---3.1 exiting
% 1.50/1.23 % E exiting
%------------------------------------------------------------------------------