TSTP Solution File: CSR032+6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR032+6 : TPTP v8.2.0. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:20 EDT 2024
% Result : Theorem 139.66s 70.59s
% Output : CNFRefutation 139.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 1 sgn 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query282,conjecture,
? [X34] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X34) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query282) ).
fof(ax5_3342443,axiom,
! [X16] :
( individual(X16)
=> isa(X16,c_individual) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_3342443) ).
fof(ax5_584595,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_584595) ).
fof(c_0_3,negated_conjecture,
~ ? [X34] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X34) ),
inference(assume_negation,[status(cth)],[query282]) ).
fof(c_0_4,plain,
! [X1530] :
( ~ individual(X1530)
| isa(X1530,c_individual) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5_3342443])])]) ).
fof(c_0_5,negated_conjecture,
! [X35] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
& ~ isa(f_citynamedfn(s_agen,c_france),X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( isa(X1,c_individual)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(split_conjunct,[status(thm)],[ax5_584595]) ).
cnf(c_0_8,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR032+6 : TPTP v8.2.0. Bugfixed v5.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 01:42:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 139.66/70.59 # Version: 3.1.0
% 139.66/70.59 # Preprocessing class: FLLLLMLLSSSNFFN.
% 139.66/70.59 # Scheduled 4 strats onto 8 cores with 252 seconds (2016 total)
% 139.66/70.59 # Starting new_ho_10 with 504s (2) cores
% 139.66/70.59 # Starting sh3 with 504s (2) cores
% 139.66/70.59 # Starting ho_unfolding_3 with 504s (2) cores
% 139.66/70.59 # Starting new_ho_10_cnf2 with 504s (2) cores
% 139.66/70.59 # new_ho_10_cnf2 with pid 24812 completed with status 0
% 139.66/70.59 # Result found by new_ho_10_cnf2
% 139.66/70.59 # Preprocessing class: FLLLLMLLSSSNFFN.
% 139.66/70.59 # Scheduled 4 strats onto 8 cores with 252 seconds (2016 total)
% 139.66/70.59 # Starting new_ho_10 with 504s (2) cores
% 139.66/70.59 # Starting sh3 with 504s (2) cores
% 139.66/70.59 # Starting ho_unfolding_3 with 504s (2) cores
% 139.66/70.59 # Starting new_ho_10_cnf2 with 504s (2) cores
% 139.66/70.59 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 139.66/70.59 # Search class: FHHSM-SMLM31-MFFFFFNN
% 139.66/70.59 # Scheduled 6 strats onto 2 cores with 486 seconds (486 total)
% 139.66/70.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 263s (1) cores
% 139.66/70.59 # Starting new_ho_10_cnf2 with 49s (1) cores
% 139.66/70.59 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 24816 completed with status 0
% 139.66/70.59 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 139.66/70.59 # Preprocessing class: FLLLLMLLSSSNFFN.
% 139.66/70.59 # Scheduled 4 strats onto 8 cores with 252 seconds (2016 total)
% 139.66/70.59 # Starting new_ho_10 with 504s (2) cores
% 139.66/70.59 # Starting sh3 with 504s (2) cores
% 139.66/70.59 # Starting ho_unfolding_3 with 504s (2) cores
% 139.66/70.59 # Starting new_ho_10_cnf2 with 504s (2) cores
% 139.66/70.59 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 139.66/70.59 # Search class: FHHSM-SMLM31-MFFFFFNN
% 139.66/70.59 # Scheduled 6 strats onto 2 cores with 486 seconds (486 total)
% 139.66/70.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 263s (1) cores
% 139.66/70.59 # Preprocessing time : 1.496 s
% 139.66/70.59
% 139.66/70.59 # Proof found!
% 139.66/70.59 # SZS status Theorem
% 139.66/70.59 # SZS output start CNFRefutation
% See solution above
% 139.66/70.59 # Parsed axioms : 3341978
% 139.66/70.59 # Removed by relevancy pruning/SinE : 3321977
% 139.66/70.59 # Initial clauses : 20002
% 139.66/70.59 # Removed in clause preprocessing : 2
% 139.66/70.59 # Initial clauses in saturation : 20000
% 139.66/70.59 # Processed clauses : 1582
% 139.66/70.59 # ...of these trivial : 25
% 139.66/70.59 # ...subsumed : 88
% 139.66/70.59 # ...remaining for further processing : 1469
% 139.66/70.59 # Other redundant clauses eliminated : 9
% 139.66/70.59 # Clauses deleted for lack of memory : 0
% 139.66/70.59 # Backward-subsumed : 0
% 139.66/70.59 # Backward-rewritten : 0
% 139.66/70.59 # Generated clauses : 960
% 139.66/70.59 # ...of the previous two non-redundant : 945
% 139.66/70.59 # ...aggressively subsumed : 0
% 139.66/70.59 # Contextual simplify-reflections : 0
% 139.66/70.59 # Paramodulations : 951
% 139.66/70.59 # Factorizations : 0
% 139.66/70.59 # NegExts : 0
% 139.66/70.59 # Equation resolutions : 9
% 139.66/70.59 # Disequality decompositions : 0
% 139.66/70.59 # Total rewrite steps : 36
% 139.66/70.59 # ...of those cached : 10
% 139.66/70.59 # Propositional unsat checks : 0
% 139.66/70.59 # Propositional check models : 0
% 139.66/70.59 # Propositional check unsatisfiable : 0
% 139.66/70.59 # Propositional clauses : 0
% 139.66/70.59 # Propositional clauses after purity: 0
% 139.66/70.59 # Propositional unsat core size : 0
% 139.66/70.59 # Propositional preprocessing time : 0.000
% 139.66/70.59 # Propositional encoding time : 0.000
% 139.66/70.59 # Propositional solver time : 0.000
% 139.66/70.59 # Success case prop preproc time : 0.000
% 139.66/70.59 # Success case prop encoding time : 0.000
% 139.66/70.59 # Success case prop solver time : 0.000
% 139.66/70.59 # Current number of processed clauses : 1460
% 139.66/70.59 # Positive orientable unit clauses : 933
% 139.66/70.59 # Positive unorientable unit clauses: 0
% 139.66/70.59 # Negative unit clauses : 30
% 139.66/70.59 # Non-unit-clauses : 497
% 139.66/70.59 # Current number of unprocessed clauses: 19050
% 139.66/70.59 # ...number of literals in the above : 25591
% 139.66/70.59 # Current number of archived formulas : 0
% 139.66/70.59 # Current number of archived clauses : 0
% 139.66/70.59 # Clause-clause subsumption calls (NU) : 37834
% 139.66/70.59 # Rec. Clause-clause subsumption calls : 33844
% 139.66/70.59 # Non-unit clause-clause subsumptions : 88
% 139.66/70.59 # Unit Clause-clause subsumption calls : 8604
% 139.66/70.59 # Rewrite failures with RHS unbound : 0
% 139.66/70.59 # BW rewrite match attempts : 1
% 139.66/70.59 # BW rewrite match successes : 0
% 139.66/70.59 # Condensation attempts : 0
% 139.66/70.59 # Condensation successes : 0
% 139.66/70.59 # Termbank termtop insertions : 22594475
% 139.66/70.59 # Search garbage collected termcells : 10471887
% 139.66/70.59
% 139.66/70.59 # -------------------------------------------------
% 139.66/70.59 # User time : 15.732 s
% 139.66/70.59 # System time : 4.302 s
% 139.66/70.59 # Total time : 20.035 s
% 139.66/70.59 # Maximum resident set size: 4955696 pages
% 139.66/70.59
% 139.66/70.59 # -------------------------------------------------
% 139.66/70.59 # User time : 64.380 s
% 139.66/70.59 # System time : 6.978 s
% 139.66/70.59 # Total time : 71.359 s
% 139.66/70.59 # Maximum resident set size: 2207340 pages
% 139.66/70.59 % E---3.1 exiting
%------------------------------------------------------------------------------