TSTP Solution File: AGT015+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : AGT015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:49 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 15 ~; 7 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 29 ( 4 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query_15,conjecture,
? [X7,X8] : ~ accept_city(X7,X8),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query_15) ).
fof(a1_6,axiom,
! [X1,X4,X2] :
( the_agent_not_in_any_proposed_teams(X1,X4,X2)
=> ~ ( accept_city(X1,X2)
& accept_leader(X1,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a1_6) ).
fof(a1_5,axiom,
! [X1,X4,X2] :
( any_agent_in_all_proposed_teams(X1,X4,X2)
=> accept_leader(X1,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a1_5) ).
fof(event_11,axiom,
the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_11) ).
fof(event_12,axiom,
any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_12) ).
fof(c_0_5,negated_conjecture,
~ ? [X7,X8] : ~ accept_city(X7,X8),
inference(assume_negation,[status(cth)],[query_15]) ).
fof(c_0_6,plain,
! [X5,X6,X7] :
( ~ the_agent_not_in_any_proposed_teams(X5,X6,X7)
| ~ accept_city(X5,X7)
| ~ accept_leader(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_6])]) ).
fof(c_0_7,negated_conjecture,
! [X9,X10] : accept_city(X9,X10),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
( ~ accept_leader(X1,X2)
| ~ accept_city(X1,X3)
| ~ the_agent_not_in_any_proposed_teams(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
accept_city(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X5,X6,X7] :
( ~ any_agent_in_all_proposed_teams(X5,X6,X7)
| accept_leader(X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_5])])])]) ).
cnf(c_0_11,plain,
( ~ accept_leader(X1,X2)
| ~ the_agent_not_in_any_proposed_teams(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,plain,
the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
inference(split_conjunct,[status(thm)],[event_11]) ).
cnf(c_0_13,plain,
( accept_leader(X1,X2)
| ~ any_agent_in_all_proposed_teams(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
inference(split_conjunct,[status(thm)],[event_12]) ).
cnf(c_0_15,plain,
~ accept_leader(muslimcountrybhumanitarianorganization,countryacivilorganization),
inference(spm,[status(thm)],[c_0_11,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 : AGT015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 4 05:17:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.022 s
% 0.25/1.43
% 0.25/1.43 # Failure: Out of unprocessed clauses!
% 0.25/1.43 # OLD status GaveUp
% 0.25/1.43 # Parsed axioms : 556
% 0.25/1.43 # Removed by relevancy pruning/SinE : 555
% 0.25/1.43 # Initial clauses : 1
% 0.25/1.43 # Removed in clause preprocessing : 1
% 0.25/1.43 # Initial clauses in saturation : 0
% 0.25/1.43 # Processed clauses : 0
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 0
% 0.25/1.43 # ...remaining for further processing : 0
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 0
% 0.25/1.43 # ...of the previous two non-trivial : 0
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 0
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 0
% 0.25/1.43 # Positive orientable unit clauses : 0
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 0
% 0.25/1.43 # Non-unit-clauses : 0
% 0.25/1.43 # Current number of unprocessed clauses: 0
% 0.25/1.43 # ...number of literals in the above : 0
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 1
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43 # Non-unit clause-clause subsumptions : 0
% 0.25/1.43 # Unit Clause-clause subsumption calls : 0
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 0
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 4556
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.018 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.022 s
% 0.25/1.43 # Maximum resident set size: 3472 pages
% 0.25/1.43 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.43 # Preprocessing time : 0.030 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 17
% 0.25/1.43 # Proof object clause steps : 8
% 0.25/1.43 # Proof object formula steps : 9
% 0.25/1.43 # Proof object conjectures : 4
% 0.25/1.43 # Proof object clause conjectures : 1
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 5
% 0.25/1.43 # Proof object initial formulas used : 5
% 0.25/1.43 # Proof object generating inferences : 2
% 0.25/1.43 # Proof object simplifying inferences : 3
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 556
% 0.25/1.43 # Removed by relevancy pruning/SinE : 0
% 0.25/1.43 # Initial clauses : 629
% 0.25/1.43 # Removed in clause preprocessing : 16
% 0.25/1.43 # Initial clauses in saturation : 613
% 0.25/1.43 # Processed clauses : 678
% 0.25/1.43 # ...of these trivial : 41
% 0.25/1.43 # ...subsumed : 1
% 0.25/1.43 # ...remaining for further processing : 635
% 0.25/1.43 # Other redundant clauses eliminated : 2
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 1637
% 0.25/1.43 # ...of the previous two non-trivial : 1489
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 1633
% 0.25/1.43 # Factorizations : 2
% 0.25/1.43 # Equation resolutions : 2
% 0.25/1.43 # Current number of processed clauses : 633
% 0.25/1.43 # Positive orientable unit clauses : 551
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 44
% 0.25/1.43 # Non-unit-clauses : 38
% 0.25/1.43 # Current number of unprocessed clauses: 1424
% 0.25/1.43 # ...number of literals in the above : 2224
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 1
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 198
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 173
% 0.25/1.43 # Non-unit clause-clause subsumptions : 1
% 0.25/1.43 # Unit Clause-clause subsumption calls : 511
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 315
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 35764
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.052 s
% 0.25/1.43 # System time : 0.006 s
% 0.25/1.43 # Total time : 0.058 s
% 0.25/1.43 # Maximum resident set size: 7904 pages
%------------------------------------------------------------------------------