TSTP Solution File: AGT003+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : AGT003+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 17:57:54 EDT 2024
% Result : Theorem 0.51s 0.57s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 14 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 15 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 27 ( 6 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/AGT001+0.ax',a1_1) ).
fof(event_26,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_26) ).
fof(event_93,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_93) ).
fof(query_3,conjecture,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_3) ).
fof(event_90,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_90) ).
fof(c_0_5,plain,
! [X64,X65,X66,X67] :
( ( accept_city(X64,X65)
| ~ accept_team(X64,X67,X65,X66) )
& ( accept_leader(X64,X67)
| ~ accept_team(X64,X67,X65,X66) )
& ( accept_number(X64,X66)
| ~ accept_team(X64,X67,X65,X66) )
& ( ~ accept_city(X64,X65)
| ~ accept_leader(X64,X67)
| ~ accept_number(X64,X66)
| accept_team(X64,X67,X65,X66) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_1])])])]) ).
cnf(c_0_6,plain,
( accept_city(X1,X2)
| ~ accept_team(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,plain,
accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
inference(split_conjunct,[status(thm)],[event_26]) ).
cnf(c_0_8,plain,
( accept_team(X1,X3,X2,X4)
| ~ accept_city(X1,X2)
| ~ accept_leader(X1,X3)
| ~ accept_number(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( accept_leader(X1,X2)
| ~ accept_team(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
inference(split_conjunct,[status(thm)],[event_93]) ).
fof(c_0_12,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query_3])]) ).
cnf(c_0_13,plain,
( accept_team(christiansufferterrahumanitarianorganization,X1,towna,X2)
| ~ accept_number(christiansufferterrahumanitarianorganization,X2)
| ~ accept_leader(christiansufferterrahumanitarianorganization,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( accept_number(X1,X2)
| ~ accept_team(X1,X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
inference(split_conjunct,[status(thm)],[event_90]) ).
fof(c_0_17,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,X1)
| ~ accept_number(christiansufferterrahumanitarianorganization,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
accept_number(christiansufferterrahumanitarianorganization,n5),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : AGT003+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 18:54:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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
% 0.51/0.57 # Version: 3.1.0
% 0.51/0.57 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.51/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.57 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.51/0.57 # Starting new_bool_3 with 600s (2) cores
% 0.51/0.57 # Starting new_bool_1 with 600s (2) cores
% 0.51/0.57 # Starting sh5l with 300s (1) cores
% 0.51/0.57 # sh5l with pid 8027 completed with status 0
% 0.51/0.57 # Result found by sh5l
% 0.51/0.57 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.51/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.57 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.51/0.57 # Starting new_bool_3 with 600s (2) cores
% 0.51/0.57 # Starting new_bool_1 with 600s (2) cores
% 0.51/0.57 # Starting sh5l with 300s (1) cores
% 0.51/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.51/0.57 # Search class: FGHSF-FFLM21-SFFFFFNN
% 0.51/0.57 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 0.51/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.51/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.51/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 8032 completed with status 0
% 0.51/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.51/0.57 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.51/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.57 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.51/0.57 # Starting new_bool_3 with 600s (2) cores
% 0.51/0.57 # Starting new_bool_1 with 600s (2) cores
% 0.51/0.57 # Starting sh5l with 300s (1) cores
% 0.51/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.51/0.57 # Search class: FGHSF-FFLM21-SFFFFFNN
% 0.51/0.57 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 0.51/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.51/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.51/0.57 # Preprocessing time : 0.004 s
% 0.51/0.57 # Presaturation interreduction done
% 0.51/0.57
% 0.51/0.57 # Proof found!
% 0.51/0.57 # SZS status Theorem
% 0.51/0.57 # SZS output start CNFRefutation
% See solution above
% 0.51/0.57 # Parsed axioms : 556
% 0.51/0.57 # Removed by relevancy pruning/SinE : 259
% 0.51/0.57 # Initial clauses : 310
% 0.51/0.57 # Removed in clause preprocessing : 0
% 0.51/0.57 # Initial clauses in saturation : 310
% 0.51/0.57 # Processed clauses : 940
% 0.51/0.57 # ...of these trivial : 103
% 0.51/0.57 # ...subsumed : 1
% 0.51/0.57 # ...remaining for further processing : 836
% 0.51/0.57 # Other redundant clauses eliminated : 2
% 0.51/0.57 # Clauses deleted for lack of memory : 0
% 0.51/0.57 # Backward-subsumed : 0
% 0.51/0.57 # Backward-rewritten : 3
% 0.51/0.57 # Generated clauses : 764
% 0.51/0.57 # ...of the previous two non-redundant : 563
% 0.51/0.57 # ...aggressively subsumed : 0
% 0.51/0.57 # Contextual simplify-reflections : 0
% 0.51/0.57 # Paramodulations : 760
% 0.51/0.57 # Factorizations : 2
% 0.51/0.57 # NegExts : 0
% 0.51/0.57 # Equation resolutions : 2
% 0.51/0.57 # Disequality decompositions : 0
% 0.51/0.57 # Total rewrite steps : 309
% 0.51/0.57 # ...of those cached : 180
% 0.51/0.57 # Propositional unsat checks : 0
% 0.51/0.57 # Propositional check models : 0
% 0.51/0.57 # Propositional check unsatisfiable : 0
% 0.51/0.57 # Propositional clauses : 0
% 0.51/0.57 # Propositional clauses after purity: 0
% 0.51/0.57 # Propositional unsat core size : 0
% 0.51/0.57 # Propositional preprocessing time : 0.000
% 0.51/0.57 # Propositional encoding time : 0.000
% 0.51/0.57 # Propositional solver time : 0.000
% 0.51/0.57 # Success case prop preproc time : 0.000
% 0.51/0.57 # Success case prop encoding time : 0.000
% 0.51/0.57 # Success case prop solver time : 0.000
% 0.51/0.57 # Current number of processed clauses : 521
% 0.51/0.57 # Positive orientable unit clauses : 409
% 0.51/0.57 # Positive unorientable unit clauses: 0
% 0.51/0.57 # Negative unit clauses : 44
% 0.51/0.57 # Non-unit-clauses : 68
% 0.51/0.57 # Current number of unprocessed clauses: 242
% 0.51/0.57 # ...number of literals in the above : 593
% 0.51/0.57 # Current number of archived formulas : 0
% 0.51/0.57 # Current number of archived clauses : 313
% 0.51/0.57 # Clause-clause subsumption calls (NU) : 1082
% 0.51/0.57 # Rec. Clause-clause subsumption calls : 914
% 0.51/0.57 # Non-unit clause-clause subsumptions : 0
% 0.51/0.57 # Unit Clause-clause subsumption calls : 1317
% 0.51/0.57 # Rewrite failures with RHS unbound : 0
% 0.51/0.57 # BW rewrite match attempts : 343
% 0.51/0.57 # BW rewrite match successes : 3
% 0.51/0.57 # Condensation attempts : 0
% 0.51/0.57 # Condensation successes : 0
% 0.51/0.57 # Termbank termtop insertions : 18005
% 0.51/0.57 # Search garbage collected termcells : 1738
% 0.51/0.57
% 0.51/0.57 # -------------------------------------------------
% 0.51/0.57 # User time : 0.036 s
% 0.51/0.57 # System time : 0.009 s
% 0.51/0.57 # Total time : 0.045 s
% 0.51/0.57 # Maximum resident set size: 3004 pages
% 0.51/0.57
% 0.51/0.57 # -------------------------------------------------
% 0.51/0.57 # User time : 0.044 s
% 0.51/0.57 # System time : 0.011 s
% 0.51/0.57 # Total time : 0.056 s
% 0.51/0.57 # Maximum resident set size: 2140 pages
% 0.51/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------