TSTP Solution File: NLP129+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP129+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 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 : Mon Jul 18 02:12:59 EDT 2022
% Result : CounterSatisfiable 0.18s 0.35s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NLP129+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.33 % Computer : n025.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jul 1 02:53:38 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.34 # No SInE strategy applied
% 0.18/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.34 #
% 0.18/0.34 # Presaturation interreduction done
% 0.18/0.34 # Number of axioms: 52 Number of unprocessed: 52
% 0.18/0.34 # Tableaux proof search.
% 0.18/0.34 # APR header successfully linked.
% 0.18/0.34 # Hello from C++
% 0.18/0.34 # The folding up rule is enabled...
% 0.18/0.34 # Local unification is enabled...
% 0.18/0.34 # Any saturation attempts will use folding labels...
% 0.18/0.34 # 52 beginning clauses after preprocessing and clausification
% 0.18/0.34 # Creating start rules for all 17 conjectures.
% 0.18/0.34 # There are 17 start rule candidates:
% 0.18/0.34 # Found 17 unit axioms.
% 0.18/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.34 # 17 start rule tableaux created.
% 0.18/0.34 # 35 extension rule candidate clauses
% 0.18/0.34 # 17 unit axiom clauses
% 0.18/0.34
% 0.18/0.34 # Requested 8, 32 cores available to the main process.
% 0.18/0.35 # 32011 Satisfiable branch
% 0.18/0.35 # Satisfiable branch found.
% 0.18/0.35 # There were 1 total branch saturation attempts.
% 0.18/0.35 # There were 0 of these attempts blocked.
% 0.18/0.35 # There were 0 deferred branch saturation attempts.
% 0.18/0.35 # There were 0 free duplicated saturations.
% 0.18/0.35 # There were 0 total successful branch saturations.
% 0.18/0.35 # There were 0 successful branch saturations in interreduction.
% 0.18/0.35 # There were 0 successful branch saturations on the branch.
% 0.18/0.35 # There were 0 successful branch saturations after the branch.
% 0.18/0.35 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.35 # Begin clausification derivation
% 0.18/0.35
% 0.18/0.35 # End clausification derivation
% 0.18/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.35 cnf(i_0_52, negated_conjecture, (actual_world(esk1_0))).
% 0.18/0.35 cnf(i_0_51, negated_conjecture, (chevy(esk1_0,esk2_0))).
% 0.18/0.35 cnf(i_0_46, negated_conjecture, (city(esk1_0,esk4_0))).
% 0.18/0.35 cnf(i_0_45, negated_conjecture, (hollywood_placename(esk1_0,esk3_0))).
% 0.18/0.35 cnf(i_0_44, negated_conjecture, (placename(esk1_0,esk3_0))).
% 0.18/0.35 cnf(i_0_43, negated_conjecture, (street(esk1_0,esk4_0))).
% 0.18/0.35 cnf(i_0_41, negated_conjecture, (event(esk1_0,esk5_0))).
% 0.18/0.35 cnf(i_0_38, negated_conjecture, (barrel(esk1_0,esk5_0))).
% 0.18/0.35 cnf(i_0_50, negated_conjecture, (white(esk1_0,esk2_0))).
% 0.18/0.35 cnf(i_0_49, negated_conjecture, (dirty(esk1_0,esk2_0))).
% 0.18/0.35 cnf(i_0_48, negated_conjecture, (old(esk1_0,esk2_0))).
% 0.18/0.35 cnf(i_0_42, negated_conjecture, (lonely(esk1_0,esk4_0))).
% 0.18/0.35 cnf(i_0_39, negated_conjecture, (present(esk1_0,esk5_0))).
% 0.18/0.35 cnf(i_0_47, negated_conjecture, (of(esk1_0,esk3_0,esk4_0))).
% 0.18/0.35 cnf(i_0_40, negated_conjecture, (agent(esk1_0,esk5_0,esk2_0))).
% 0.18/0.35 cnf(i_0_37, negated_conjecture, (down(esk1_0,esk5_0,esk4_0))).
% 0.18/0.35 cnf(i_0_36, negated_conjecture, (in(esk1_0,esk5_0,esk4_0))).
% 0.18/0.35 cnf(i_0_34, plain, (~specific(X1,X2)|~general(X1,X2))).
% 0.18/0.35 cnf(i_0_33, plain, (~nonexistent(X1,X2)|~existent(X1,X2))).
% 0.18/0.35 cnf(i_0_2, plain, (instrumentality(X1,X2)|~transport(X1,X2))).
% 0.18/0.35 cnf(i_0_1, plain, (artifact(X1,X2)|~instrumentality(X1,X2))).
% 0.18/0.35 cnf(i_0_24, plain, (artifact(X1,X2)|~way(X1,X2))).
% 0.18/0.35 cnf(i_0_3, plain, (transport(X1,X2)|~vehicle(X1,X2))).
% 0.18/0.35 cnf(i_0_4, plain, (vehicle(X1,X2)|~car(X1,X2))).
% 0.18/0.35 cnf(i_0_23, plain, (object(X1,X2)|~artifact(X1,X2))).
% 0.18/0.35 cnf(i_0_8, plain, (placename(X1,X2)|~hollywood_placename(X1,X2))).
% 0.18/0.35 cnf(i_0_32, plain, (event(X1,X2)|~barrel(X1,X2))).
% 0.18/0.35 cnf(i_0_5, plain, (car(X1,X2)|~chevy(X1,X2))).
% 0.18/0.35 cnf(i_0_31, plain, (eventuality(X1,X2)|~event(X1,X2))).
% 0.18/0.35 cnf(i_0_6, plain, (object(X1,X2)|~location(X1,X2))).
% 0.18/0.35 cnf(i_0_13, plain, (abstraction(X1,X2)|~relation(X1,X2))).
% 0.18/0.35 cnf(i_0_14, plain, (relation(X1,X2)|~relname(X1,X2))).
% 0.18/0.35 cnf(i_0_7, plain, (location(X1,X2)|~city(X1,X2))).
% 0.18/0.35 cnf(i_0_15, plain, (relname(X1,X2)|~placename(X1,X2))).
% 0.18/0.35 cnf(i_0_25, plain, (way(X1,X2)|~street(X1,X2))).
% 0.18/0.35 cnf(i_0_16, plain, (unisex(X1,X2)|~object(X1,X2))).
% 0.18/0.35 cnf(i_0_9, plain, (unisex(X1,X2)|~abstraction(X1,X2))).
% 0.18/0.35 cnf(i_0_26, plain, (unisex(X1,X2)|~eventuality(X1,X2))).
% 0.18/0.35 cnf(i_0_10, plain, (general(X1,X2)|~abstraction(X1,X2))).
% 0.18/0.35 cnf(i_0_11, plain, (nonhuman(X1,X2)|~abstraction(X1,X2))).
% 0.18/0.35 cnf(i_0_12, plain, (thing(X1,X2)|~abstraction(X1,X2))).
% 0.18/0.35 cnf(i_0_21, plain, (thing(X1,X2)|~entity(X1,X2))).
% 0.18/0.35 cnf(i_0_30, plain, (thing(X1,X2)|~eventuality(X1,X2))).
% 0.18/0.35 cnf(i_0_17, plain, (impartial(X1,X2)|~object(X1,X2))).
% 0.18/0.35 cnf(i_0_18, plain, (nonliving(X1,X2)|~object(X1,X2))).
% 0.18/0.35 cnf(i_0_22, plain, (entity(X1,X2)|~object(X1,X2))).
% 0.18/0.35 cnf(i_0_19, plain, (existent(X1,X2)|~entity(X1,X2))).
% 0.18/0.35 cnf(i_0_20, plain, (specific(X1,X2)|~entity(X1,X2))).
% 0.18/0.35 cnf(i_0_28, plain, (specific(X1,X2)|~eventuality(X1,X2))).
% 0.18/0.35 cnf(i_0_27, plain, (nonexistent(X1,X2)|~eventuality(X1,X2))).
% 0.18/0.35 cnf(i_0_29, plain, (singleton(X1,X2)|~thing(X1,X2))).
% 0.18/0.35 cnf(i_0_35, plain, (X1=X2|~of(X3,X2,X4)|~of(X3,X1,X4)|~entity(X3,X4)|~placename(X3,X2)|~placename(X3,X1))).
% 0.18/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.35 # Begin printing tableau
% 0.18/0.35 # Found 3 steps
% 0.18/0.35 cnf(i_0_51, negated_conjecture, (chevy(esk1_0,esk2_0)), inference(start_rule)).
% 0.18/0.35 cnf(i_0_68, plain, (chevy(esk1_0,esk2_0)), inference(extension_rule, [i_0_5])).
% 0.18/0.35 cnf(i_0_164, plain, (car(esk1_0,esk2_0)), inference(extension_rule, [i_0_4])).
% 0.18/0.35 # End printing tableau
% 0.18/0.35 # SZS output end
% 0.18/0.35 # Branches closed with saturation will be marked with an "s"
% 0.18/0.35 # Child (32011) has found a proof.
% 0.18/0.35
% 0.18/0.35 # Proof search is over...
% 0.18/0.35 # Freeing feature tree
%------------------------------------------------------------------------------