TSTP Solution File: AGT017+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : AGT017+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 : 600s
% DateTime : Thu Jul 14 11:57:50 EDT 2022
% Result : Theorem 0.30s 1.47s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query_17,conjecture,
? [X7] : ~ accept_city(muslimcountrybhumanitarianorganization,X7),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query_17) ).
fof(deduced_366,axiom,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+2.ax',deduced_366) ).
fof(c_0_2,negated_conjecture,
~ ? [X7] : ~ accept_city(muslimcountrybhumanitarianorganization,X7),
inference(assume_negation,[status(cth)],[query_17]) ).
fof(c_0_3,plain,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
inference(fof_simplification,[status(thm)],[deduced_366]) ).
fof(c_0_4,negated_conjecture,
! [X8] : accept_city(muslimcountrybhumanitarianorganization,X8),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
accept_city(muslimcountrybhumanitarianorganization,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : AGT017+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 4 03:21:32 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.30/1.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.30/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.30/1.47 # Preprocessing time : 0.027 s
% 0.30/1.47
% 0.30/1.47 # Proof found!
% 0.30/1.47 # SZS status Theorem
% 0.30/1.47 # SZS output start CNFRefutation
% See solution above
% 0.30/1.47 # Proof object total steps : 8
% 0.30/1.47 # Proof object clause steps : 3
% 0.30/1.47 # Proof object formula steps : 5
% 0.30/1.47 # Proof object conjectures : 4
% 0.30/1.47 # Proof object clause conjectures : 1
% 0.30/1.47 # Proof object formula conjectures : 3
% 0.30/1.47 # Proof object initial clauses used : 2
% 0.30/1.47 # Proof object initial formulas used : 2
% 0.30/1.47 # Proof object generating inferences : 0
% 0.30/1.47 # Proof object simplifying inferences : 2
% 0.30/1.47 # Training examples: 0 positive, 0 negative
% 0.30/1.47 # Parsed axioms : 923
% 0.30/1.47 # Removed by relevancy pruning/SinE : 822
% 0.30/1.47 # Initial clauses : 104
% 0.30/1.47 # Removed in clause preprocessing : 0
% 0.30/1.47 # Initial clauses in saturation : 104
% 0.30/1.47 # Processed clauses : 2
% 0.30/1.47 # ...of these trivial : 0
% 0.30/1.47 # ...subsumed : 0
% 0.30/1.47 # ...remaining for further processing : 2
% 0.30/1.47 # Other redundant clauses eliminated : 0
% 0.30/1.47 # Clauses deleted for lack of memory : 0
% 0.30/1.47 # Backward-subsumed : 0
% 0.30/1.47 # Backward-rewritten : 1
% 0.30/1.47 # Generated clauses : 0
% 0.30/1.47 # ...of the previous two non-trivial : 0
% 0.30/1.47 # Contextual simplify-reflections : 0
% 0.30/1.47 # Paramodulations : 0
% 0.30/1.47 # Factorizations : 0
% 0.30/1.47 # Equation resolutions : 0
% 0.30/1.47 # Current number of processed clauses : 1
% 0.30/1.47 # Positive orientable unit clauses : 1
% 0.30/1.47 # Positive unorientable unit clauses: 0
% 0.30/1.47 # Negative unit clauses : 0
% 0.30/1.47 # Non-unit-clauses : 0
% 0.30/1.47 # Current number of unprocessed clauses: 102
% 0.30/1.47 # ...number of literals in the above : 108
% 0.30/1.47 # Current number of archived formulas : 0
% 0.30/1.47 # Current number of archived clauses : 1
% 0.30/1.47 # Clause-clause subsumption calls (NU) : 0
% 0.30/1.47 # Rec. Clause-clause subsumption calls : 0
% 0.30/1.47 # Non-unit clause-clause subsumptions : 0
% 0.30/1.47 # Unit Clause-clause subsumption calls : 0
% 0.30/1.47 # Rewrite failures with RHS unbound : 0
% 0.30/1.47 # BW rewrite match attempts : 1
% 0.30/1.47 # BW rewrite match successes : 1
% 0.30/1.47 # Condensation attempts : 0
% 0.30/1.47 # Condensation successes : 0
% 0.30/1.47 # Termbank termtop insertions : 7880
% 0.30/1.47
% 0.30/1.47 # -------------------------------------------------
% 0.30/1.47 # User time : 0.024 s
% 0.30/1.47 # System time : 0.003 s
% 0.30/1.47 # Total time : 0.027 s
% 0.30/1.47 # Maximum resident set size: 4040 pages
%------------------------------------------------------------------------------