TSTP Solution File: AGT016+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : AGT016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Thu Jul 14 11:57:50 EDT 2022
% Result : Theorem 0.27s 1.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 65 ( 30 ~; 22 |; 10 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 30 ( 4 sgn 17 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(query_16,conjecture,
? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query_16) ).
fof(a2_9,axiom,
! [X1] :
( ( accept_population(X1,atheist,n75)
& accept_population(X1,christian,n24)
& accept_population(X1,muslim,n1)
& accept_population(X1,native,n0)
& accept_population(X1,other,n0) )
<=> accept_city(X1,towna) ),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a2_9) ).
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,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_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,plain,
the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
inference(split_conjunct,[status(thm)],[event_11]) ).
cnf(c_0_10,plain,
( accept_leader(X1,X2)
| ~ any_agent_in_all_proposed_teams(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
inference(split_conjunct,[status(thm)],[event_12]) ).
fof(c_0_12,negated_conjecture,
~ ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
inference(assume_negation,[status(cth)],[query_16]) ).
cnf(c_0_13,plain,
( ~ accept_leader(muslimcountrybhumanitarianorganization,countryacivilorganization)
| ~ accept_city(muslimcountrybhumanitarianorganization,towna) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
accept_leader(muslimcountrybhumanitarianorganization,countryacivilorganization),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,plain,
! [X2,X2] :
( ( ~ accept_population(X2,atheist,n75)
| ~ accept_population(X2,christian,n24)
| ~ accept_population(X2,muslim,n1)
| ~ accept_population(X2,native,n0)
| ~ accept_population(X2,other,n0)
| accept_city(X2,towna) )
& ( accept_population(X2,atheist,n75)
| ~ accept_city(X2,towna) )
& ( accept_population(X2,christian,n24)
| ~ accept_city(X2,towna) )
& ( accept_population(X2,muslim,n1)
| ~ accept_city(X2,towna) )
& ( accept_population(X2,native,n0)
| ~ accept_city(X2,towna) )
& ( accept_population(X2,other,n0)
| ~ accept_city(X2,towna) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_9])])])])]) ).
fof(c_0_16,negated_conjecture,
! [X9,X10] : accept_population(muslimcountrybhumanitarianorganization,X9,X10),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])]) ).
cnf(c_0_17,plain,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,plain,
( accept_city(X1,towna)
| ~ accept_population(X1,other,n0)
| ~ accept_population(X1,native,n0)
| ~ accept_population(X1,muslim,n1)
| ~ accept_population(X1,christian,n24)
| ~ accept_population(X1,atheist,n75) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
accept_population(muslimcountrybhumanitarianorganization,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : AGT016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n019.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 4 06:43:55 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.27/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.46 # Preprocessing time : 0.025 s
% 0.27/1.46
% 0.27/1.46 # Failure: Out of unprocessed clauses!
% 0.27/1.46 # OLD status GaveUp
% 0.27/1.46 # Parsed axioms : 556
% 0.27/1.46 # Removed by relevancy pruning/SinE : 455
% 0.27/1.46 # Initial clauses : 101
% 0.27/1.46 # Removed in clause preprocessing : 0
% 0.27/1.46 # Initial clauses in saturation : 101
% 0.27/1.46 # Processed clauses : 101
% 0.27/1.46 # ...of these trivial : 0
% 0.27/1.46 # ...subsumed : 0
% 0.27/1.46 # ...remaining for further processing : 101
% 0.27/1.46 # Other redundant clauses eliminated : 0
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 0
% 0.27/1.46 # Backward-rewritten : 0
% 0.27/1.46 # Generated clauses : 0
% 0.27/1.46 # ...of the previous two non-trivial : 0
% 0.27/1.46 # Contextual simplify-reflections : 0
% 0.27/1.46 # Paramodulations : 0
% 0.27/1.46 # Factorizations : 0
% 0.27/1.46 # Equation resolutions : 0
% 0.27/1.46 # Current number of processed clauses : 101
% 0.27/1.46 # Positive orientable unit clauses : 79
% 0.27/1.46 # Positive unorientable unit clauses: 0
% 0.27/1.46 # Negative unit clauses : 22
% 0.27/1.46 # Non-unit-clauses : 0
% 0.27/1.46 # Current number of unprocessed clauses: 0
% 0.27/1.46 # ...number of literals in the above : 0
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 0
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 0
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 0
% 0.27/1.46 # Non-unit clause-clause subsumptions : 0
% 0.27/1.46 # Unit Clause-clause subsumption calls : 209
% 0.27/1.46 # Rewrite failures with RHS unbound : 0
% 0.27/1.46 # BW rewrite match attempts : 94
% 0.27/1.46 # BW rewrite match successes : 0
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 6427
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.023 s
% 0.27/1.46 # System time : 0.004 s
% 0.27/1.46 # Total time : 0.028 s
% 0.27/1.46 # Maximum resident set size: 4076 pages
% 0.27/1.46 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.27/1.46 # Preprocessing time : 0.032 s
% 0.27/1.46
% 0.27/1.46 # Proof found!
% 0.27/1.46 # SZS status Theorem
% 0.27/1.46 # SZS output start CNFRefutation
% See solution above
% 0.27/1.46 # Proof object total steps : 21
% 0.27/1.46 # Proof object clause steps : 10
% 0.27/1.46 # Proof object formula steps : 11
% 0.27/1.46 # Proof object conjectures : 4
% 0.27/1.46 # Proof object clause conjectures : 1
% 0.27/1.46 # Proof object formula conjectures : 3
% 0.27/1.46 # Proof object initial clauses used : 6
% 0.27/1.46 # Proof object initial formulas used : 6
% 0.27/1.46 # Proof object generating inferences : 3
% 0.27/1.46 # Proof object simplifying inferences : 8
% 0.27/1.46 # Training examples: 0 positive, 0 negative
% 0.27/1.46 # Parsed axioms : 556
% 0.27/1.46 # Removed by relevancy pruning/SinE : 0
% 0.27/1.46 # Initial clauses : 629
% 0.27/1.46 # Removed in clause preprocessing : 0
% 0.27/1.46 # Initial clauses in saturation : 629
% 0.27/1.46 # Processed clauses : 644
% 0.27/1.46 # ...of these trivial : 1
% 0.27/1.46 # ...subsumed : 0
% 0.27/1.46 # ...remaining for further processing : 643
% 0.27/1.46 # Other redundant clauses eliminated : 2
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 0
% 0.27/1.46 # Backward-rewritten : 1
% 0.27/1.46 # Generated clauses : 1106
% 0.27/1.46 # ...of the previous two non-trivial : 939
% 0.27/1.46 # Contextual simplify-reflections : 0
% 0.27/1.46 # Paramodulations : 1102
% 0.27/1.46 # Factorizations : 2
% 0.27/1.46 # Equation resolutions : 2
% 0.27/1.46 # Current number of processed clauses : 640
% 0.27/1.46 # Positive orientable unit clauses : 491
% 0.27/1.46 # Positive unorientable unit clauses: 0
% 0.27/1.46 # Negative unit clauses : 42
% 0.27/1.46 # Non-unit-clauses : 107
% 0.27/1.46 # Current number of unprocessed clauses: 924
% 0.27/1.46 # ...number of literals in the above : 1725
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 1
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 2736
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 1041
% 0.27/1.46 # Non-unit clause-clause subsumptions : 0
% 0.27/1.46 # Unit Clause-clause subsumption calls : 767
% 0.27/1.46 # Rewrite failures with RHS unbound : 0
% 0.27/1.46 # BW rewrite match attempts : 171
% 0.27/1.46 # BW rewrite match successes : 1
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 33576
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.050 s
% 0.27/1.46 # System time : 0.010 s
% 0.27/1.46 # Total time : 0.060 s
% 0.27/1.46 # Maximum resident set size: 7372 pages
%------------------------------------------------------------------------------