TSTP Solution File: MSC003-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MSC003-1 : TPTP v8.1.0. Released v1.0.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 : 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 : 600s
% DateTime : Sun Jul 17 22:43:11 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : MSC003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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 : Fri Jul 1 15:25:19 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 8 Number of unprocessed: 8
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 8 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 1 conjectures.
% 0.14/0.39 # There are 1 start rule candidates:
% 0.14/0.39 # Found 2 unit axioms.
% 0.14/0.39 # 1 start rule tableaux created.
% 0.14/0.39 # 6 extension rule candidate clauses
% 0.14/0.39 # 2 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.39 # There were 2 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 2 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 2 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_11, hypothesis, (in(john,boy))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (~has_parts(john,times(n2,n1),hand))).
% 0.14/0.39 cnf(i_0_15, hypothesis, (has_parts(X1,n1,hand)|~in(X1,arm))).
% 0.14/0.39 cnf(i_0_13, hypothesis, (has_parts(X1,n5,fingers)|~in(X1,hand))).
% 0.14/0.39 cnf(i_0_14, hypothesis, (has_parts(X1,n2,arm)|~in(X1,human))).
% 0.14/0.39 cnf(i_0_12, hypothesis, (in(X1,human)|~in(X1,boy))).
% 0.14/0.39 cnf(i_0_9, plain, (has_parts(X1,times(X2,X3),X4)|in(object_in(X1,X5,X4,X2,X3),X5)|~has_parts(X1,X2,X5))).
% 0.14/0.39 cnf(i_0_10, plain, (has_parts(X1,times(X2,X3),X4)|~has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)|~has_parts(X1,X2,X5))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 5 steps
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (~has_parts(john,times(n2,n1),hand)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_17, plain, (~has_parts(john,times(n2,n1),hand)), inference(extension_rule, [i_0_10])).
% 0.14/0.39 cnf(i_0_31, plain, (~has_parts(john,n2,arm)), inference(extension_rule, [i_0_14])).
% 0.14/0.39 cnf(i_0_30, plain, (~has_parts(object_in(john,arm,hand,n2,n1),n1,hand)), inference(etableau_closure_rule, [i_0_30, ...])).
% 0.14/0.39 cnf(i_0_51, plain, (~in(john,human)), inference(etableau_closure_rule, [i_0_51, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 3 tableaux to operate on
% 0.14/0.39 # Found closed tableau during pool population.
% 0.14/0.39 # Proof search is over...
% 0.14/0.39 # Freeing feature tree
%------------------------------------------------------------------------------