TSTP Solution File: AGT004+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : AGT004+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:47 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 26 ( 13 ~; 7 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 6 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query_4,conjecture,
~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query_4) ).
fof(a1_1,axiom,
! [X1,X2,X3,X4] :
( accept_team(X1,X4,X2,X3)
<=> ( accept_city(X1,X2)
& accept_leader(X1,X4)
& accept_number(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+0.ax',a1_1) ).
fof(deduced_13,axiom,
~ accept_city(countryamedicalorganization,coastvillage),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+2.ax',deduced_13) ).
fof(c_0_3,negated_conjecture,
~ ~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(assume_negation,[status(cth)],[query_4]) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( accept_city(X5,X6)
| ~ accept_team(X5,X8,X6,X7) )
& ( accept_leader(X5,X8)
| ~ accept_team(X5,X8,X6,X7) )
& ( accept_number(X5,X7)
| ~ accept_team(X5,X8,X6,X7) )
& ( ~ accept_city(X5,X6)
| ~ accept_leader(X5,X8)
| ~ accept_number(X5,X7)
| accept_team(X5,X8,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_1])])])])]) ).
fof(c_0_5,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(fof_simplification,[status(thm)],[deduced_13]) ).
cnf(c_0_7,plain,
( accept_city(X1,X3)
| ~ accept_team(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : AGT004+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 4 05:10:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.027 s
% 0.25/1.44
% 0.25/1.44 # Failure: Out of unprocessed clauses!
% 0.25/1.44 # OLD status GaveUp
% 0.25/1.44 # Parsed axioms : 923
% 0.25/1.44 # Removed by relevancy pruning/SinE : 822
% 0.25/1.44 # Initial clauses : 101
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 101
% 0.25/1.44 # Processed clauses : 101
% 0.25/1.44 # ...of these trivial : 8
% 0.25/1.44 # ...subsumed : 0
% 0.25/1.44 # ...remaining for further processing : 93
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 0
% 0.25/1.44 # Generated clauses : 0
% 0.25/1.44 # ...of the previous two non-trivial : 0
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 0
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 93
% 0.25/1.44 # Positive orientable unit clauses : 81
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 12
% 0.25/1.44 # Non-unit-clauses : 0
% 0.25/1.44 # Current number of unprocessed clauses: 0
% 0.25/1.44 # ...number of literals in the above : 0
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 0
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.44 # Non-unit clause-clause subsumptions : 0
% 0.25/1.44 # Unit Clause-clause subsumption calls : 22
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 25
% 0.25/1.44 # BW rewrite match successes : 0
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 7811
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.026 s
% 0.25/1.44 # System time : 0.003 s
% 0.25/1.44 # Total time : 0.029 s
% 0.25/1.44 # Maximum resident set size: 4272 pages
% 0.25/1.44 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.44 # Preprocessing time : 0.036 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 11
% 0.25/1.44 # Proof object clause steps : 4
% 0.25/1.44 # Proof object formula steps : 7
% 0.25/1.44 # Proof object conjectures : 5
% 0.25/1.44 # Proof object clause conjectures : 2
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 3
% 0.25/1.44 # Proof object initial formulas used : 3
% 0.25/1.44 # Proof object generating inferences : 1
% 0.25/1.44 # Proof object simplifying inferences : 1
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 923
% 0.25/1.44 # Removed by relevancy pruning/SinE : 0
% 0.25/1.44 # Initial clauses : 996
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 996
% 0.25/1.44 # Processed clauses : 122
% 0.25/1.44 # ...of these trivial : 1
% 0.25/1.44 # ...subsumed : 0
% 0.25/1.44 # ...remaining for further processing : 121
% 0.25/1.44 # Other redundant clauses eliminated : 2
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 0
% 0.25/1.44 # Generated clauses : 21
% 0.25/1.44 # ...of the previous two non-trivial : 15
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 17
% 0.25/1.44 # Factorizations : 2
% 0.25/1.44 # Equation resolutions : 2
% 0.25/1.44 # Current number of processed clauses : 119
% 0.25/1.44 # Positive orientable unit clauses : 57
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 45
% 0.25/1.44 # Non-unit-clauses : 17
% 0.25/1.44 # Current number of unprocessed clauses: 889
% 0.25/1.44 # ...number of literals in the above : 1046
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 0
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 40
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 36
% 0.25/1.44 # Non-unit clause-clause subsumptions : 0
% 0.25/1.44 # Unit Clause-clause subsumption calls : 800
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 0
% 0.25/1.44 # BW rewrite match successes : 0
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 29480
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.033 s
% 0.25/1.44 # System time : 0.007 s
% 0.25/1.44 # Total time : 0.040 s
% 0.25/1.44 # Maximum resident set size: 5264 pages
%------------------------------------------------------------------------------