TSTP Solution File: CSR031+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR031+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 0.16s 0.47s
% Output : CNFRefutation 0.16s
% 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(ax1_289,axiom,
! [X1] :
~ ( collection(X1)
& individual(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_289) ).
fof(ax1_1119,axiom,
! [X10,X6] :
( disjointwith(X10,X6)
=> collection(X10) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_1119) ).
fof(query81,conjecture,
~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query81) ).
fof(ax1_447,axiom,
individual(c_tptptptpcol_16_8398),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_447) ).
fof(c_0_4,plain,
! [X94] :
( ~ collection(X94)
| ~ individual(X94) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_289])])]) ).
fof(c_0_5,plain,
! [X31,X32] :
( ~ disjointwith(X31,X32)
| collection(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1119])])]) ).
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)],[query81])]) ).
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)],[ax1_447]) ).
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.03/0.10 % Problem : CSR031+2 : TPTP v8.2.0. Released v3.4.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 00:36:22 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.16/0.47 # Version: 3.1.0
% 0.16/0.47 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.16/0.47 # Starting new_bool_3 with 600s (2) cores
% 0.16/0.47 # Starting new_bool_1 with 600s (2) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # new_bool_1 with pid 32059 completed with status 0
% 0.16/0.47 # Result found by new_bool_1
% 0.16/0.47 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.16/0.47 # Starting new_bool_3 with 600s (2) cores
% 0.16/0.47 # Starting new_bool_1 with 600s (2) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FHHNF-FFMF00-SFFFFFNN
% 0.16/0.47 # partial match(1): FHHNF-FFMM00-SFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.16/0.47 # SAT001_MinMin_p005000_rr_RG with pid 32062 completed with status 0
% 0.16/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.47 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.16/0.47 # Starting new_bool_3 with 600s (2) cores
% 0.16/0.47 # Starting new_bool_1 with 600s (2) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FHHNF-FFMF00-SFFFFFNN
% 0.16/0.47 # partial match(1): FHHNF-FFMM00-SFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.16/0.47 # Preprocessing time : 0.003 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 1132
% 0.16/0.47 # Removed by relevancy pruning/SinE : 1090
% 0.16/0.47 # Initial clauses : 42
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 42
% 0.16/0.47 # Processed clauses : 53
% 0.16/0.47 # ...of these trivial : 0
% 0.16/0.47 # ...subsumed : 13
% 0.16/0.47 # ...remaining for further processing : 40
% 0.16/0.47 # Other redundant clauses eliminated : 0
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 0
% 0.16/0.47 # Generated clauses : 5
% 0.16/0.47 # ...of the previous two non-redundant : 4
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 5
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 0
% 0.16/0.47 # Disequality decompositions : 0
% 0.16/0.47 # Total rewrite steps : 0
% 0.16/0.47 # ...of those cached : 0
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 11
% 0.16/0.47 # Positive orientable unit clauses : 3
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 2
% 0.16/0.47 # Non-unit-clauses : 6
% 0.16/0.47 # Current number of unprocessed clauses: 22
% 0.16/0.47 # ...number of literals in the above : 53
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 29
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 57
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 55
% 0.16/0.47 # Non-unit clause-clause subsumptions : 13
% 0.16/0.47 # Unit Clause-clause subsumption calls : 2
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 0
% 0.16/0.47 # BW rewrite match successes : 0
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 9800
% 0.16/0.47 # Search garbage collected termcells : 5122
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.005 s
% 0.16/0.47 # System time : 0.007 s
% 0.16/0.47 # Total time : 0.012 s
% 0.16/0.47 # Maximum resident set size: 4140 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.021 s
% 0.16/0.47 # System time : 0.013 s
% 0.16/0.47 # Total time : 0.035 s
% 0.16/0.47 # Maximum resident set size: 2648 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.48 % E exiting
%------------------------------------------------------------------------------