TSTP Solution File: CSR256+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR256+1 : TPTP v8.2.0. Released v7.3.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 : Mon May 20 19:17:00 EDT 2024
% Result : Theorem 4.05s 1.64s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 12 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 6 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 11 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(predefinitionsA8,axiom,
! [X1,X2,X3] :
( ( p__d__subclass(X1,X2)
& p__d__subclass(X2,X3) )
=> p__d__subclass(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA8) ).
fof(mergeA2519,axiom,
p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2519) ).
fof(mergeA2523,axiom,
p__d__subclass(c__Giving,c__ChangeOfPossession),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2523) ).
fof(subclassEvent0321,conjecture,
p__d__subclass(c__Funding,c__SocialInteraction),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclassEvent0321) ).
fof(mergeA2526,axiom,
p__d__subclass(c__Funding,c__Giving),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2526) ).
fof(c_0_5,plain,
! [X1045,X1046,X1047] :
( ~ p__d__subclass(X1045,X1046)
| ~ p__d__subclass(X1046,X1047)
| p__d__subclass(X1045,X1047) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA8])])]) ).
cnf(c_0_6,plain,
( p__d__subclass(X1,X3)
| ~ p__d__subclass(X1,X2)
| ~ p__d__subclass(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,plain,
p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
inference(split_conjunct,[status(thm)],[mergeA2519]) ).
cnf(c_0_8,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X1,c__ChangeOfPossession) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
p__d__subclass(c__Giving,c__ChangeOfPossession),
inference(split_conjunct,[status(thm)],[mergeA2523]) ).
fof(c_0_10,negated_conjecture,
~ p__d__subclass(c__Funding,c__SocialInteraction),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[subclassEvent0321])]) ).
cnf(c_0_11,plain,
p__d__subclass(c__Giving,c__SocialInteraction),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_12,negated_conjecture,
~ p__d__subclass(c__Funding,c__SocialInteraction),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X1,c__Giving) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
p__d__subclass(c__Funding,c__Giving),
inference(split_conjunct,[status(thm)],[mergeA2526]) ).
cnf(c_0_15,negated_conjecture,
~ p__d__subclass(c__Funding,c__SocialInteraction),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR256+1 : TPTP v8.2.0. Released v7.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 01:40:08 EDT 2024
% 0.14/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
% 4.05/1.64 # Version: 3.1.0
% 4.05/1.64 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.05/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.05/1.64 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.05/1.64 # Starting new_bool_3 with 300s (1) cores
% 4.05/1.64 # Starting new_bool_1 with 300s (1) cores
% 4.05/1.64 # Starting sh5l with 300s (1) cores
% 4.05/1.64 # sh5l with pid 22334 completed with status 0
% 4.05/1.64 # Result found by sh5l
% 4.05/1.64 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.05/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.05/1.64 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.05/1.64 # Starting new_bool_3 with 300s (1) cores
% 4.05/1.64 # Starting new_bool_1 with 300s (1) cores
% 4.05/1.64 # Starting sh5l with 300s (1) cores
% 4.05/1.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.05/1.64 # Search class: FGHSF-SMLM31-SFFFFFNN
% 4.05/1.64 # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 4.05/1.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 4.05/1.64 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 4.05/1.64 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22339 completed with status 0
% 4.05/1.64 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.05/1.64 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.05/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.05/1.64 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.05/1.64 # Starting new_bool_3 with 300s (1) cores
% 4.05/1.64 # Starting new_bool_1 with 300s (1) cores
% 4.05/1.64 # Starting sh5l with 300s (1) cores
% 4.05/1.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.05/1.64 # Search class: FGHSF-SMLM31-SFFFFFNN
% 4.05/1.64 # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 4.05/1.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 4.05/1.64 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 4.05/1.64 # Preprocessing time : 0.170 s
% 4.05/1.64 # Presaturation interreduction done
% 4.05/1.64
% 4.05/1.64 # Proof found!
% 4.05/1.64 # SZS status Theorem
% 4.05/1.64 # SZS output start CNFRefutation
% See solution above
% 4.05/1.64 # Parsed axioms : 7433
% 4.05/1.64 # Removed by relevancy pruning/SinE : 6004
% 4.05/1.64 # Initial clauses : 2420
% 4.05/1.64 # Removed in clause preprocessing : 2
% 4.05/1.64 # Initial clauses in saturation : 2418
% 4.05/1.64 # Processed clauses : 3756
% 4.05/1.64 # ...of these trivial : 5
% 4.05/1.64 # ...subsumed : 3
% 4.05/1.64 # ...remaining for further processing : 3748
% 4.05/1.64 # Other redundant clauses eliminated : 61
% 4.05/1.64 # Clauses deleted for lack of memory : 0
% 4.05/1.64 # Backward-subsumed : 0
% 4.05/1.64 # Backward-rewritten : 0
% 4.05/1.64 # Generated clauses : 1517
% 4.05/1.64 # ...of the previous two non-redundant : 1487
% 4.05/1.64 # ...aggressively subsumed : 0
% 4.05/1.64 # Contextual simplify-reflections : 696
% 4.05/1.64 # Paramodulations : 1461
% 4.05/1.64 # Factorizations : 0
% 4.05/1.64 # NegExts : 0
% 4.05/1.64 # Equation resolutions : 61
% 4.05/1.64 # Disequality decompositions : 0
% 4.05/1.64 # Total rewrite steps : 26
% 4.05/1.64 # ...of those cached : 1
% 4.05/1.64 # Propositional unsat checks : 0
% 4.05/1.64 # Propositional check models : 0
% 4.05/1.64 # Propositional check unsatisfiable : 0
% 4.05/1.64 # Propositional clauses : 0
% 4.05/1.64 # Propositional clauses after purity: 0
% 4.05/1.64 # Propositional unsat core size : 0
% 4.05/1.64 # Propositional preprocessing time : 0.000
% 4.05/1.64 # Propositional encoding time : 0.000
% 4.05/1.64 # Propositional solver time : 0.000
% 4.05/1.64 # Success case prop preproc time : 0.000
% 4.05/1.64 # Success case prop encoding time : 0.000
% 4.05/1.64 # Success case prop solver time : 0.000
% 4.05/1.64 # Current number of processed clauses : 1277
% 4.05/1.64 # Positive orientable unit clauses : 775
% 4.05/1.64 # Positive unorientable unit clauses: 0
% 4.05/1.64 # Negative unit clauses : 4
% 4.05/1.64 # Non-unit-clauses : 498
% 4.05/1.64 # Current number of unprocessed clauses: 2561
% 4.05/1.64 # ...number of literals in the above : 6461
% 4.05/1.64 # Current number of archived formulas : 0
% 4.05/1.64 # Current number of archived clauses : 2415
% 4.05/1.64 # Clause-clause subsumption calls (NU) : 1349333
% 4.05/1.64 # Rec. Clause-clause subsumption calls : 548817
% 4.05/1.64 # Non-unit clause-clause subsumptions : 699
% 4.05/1.64 # Unit Clause-clause subsumption calls : 31835
% 4.05/1.64 # Rewrite failures with RHS unbound : 0
% 4.05/1.64 # BW rewrite match attempts : 15
% 4.05/1.64 # BW rewrite match successes : 0
% 4.05/1.64 # Condensation attempts : 0
% 4.05/1.64 # Condensation successes : 0
% 4.05/1.64 # Termbank termtop insertions : 214008
% 4.05/1.64 # Search garbage collected termcells : 56591
% 4.05/1.64
% 4.05/1.64 # -------------------------------------------------
% 4.05/1.64 # User time : 0.876 s
% 4.05/1.64 # System time : 0.033 s
% 4.05/1.64 # Total time : 0.909 s
% 4.05/1.64 # Maximum resident set size: 20980 pages
% 4.05/1.64
% 4.05/1.64 # -------------------------------------------------
% 4.05/1.64 # User time : 1.061 s
% 4.05/1.64 # System time : 0.048 s
% 4.05/1.64 # Total time : 1.109 s
% 4.05/1.64 # Maximum resident set size: 9664 pages
% 4.05/1.64 % E---3.1 exiting
% 4.05/1.64 % E exiting
%------------------------------------------------------------------------------