TSTP Solution File: MSC002-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MSC002-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 : n004.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.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MSC002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 14:56:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 3 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 11 extension rule candidate clauses
% 0.13/0.37 # 3 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 20 tableaux to operate on
% 0.13/0.38 # There were 2 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 2 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 2 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_15, plain, (at(something,here,now))).
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (~answer(X1))).
% 0.13/0.38 cnf(i_0_18, plain, (~held(X1,let_go(X2)))).
% 0.13/0.38 cnf(i_0_23, plain, (~put(X1,there,X2)|~red(X1))).
% 0.13/0.38 cnf(i_0_19, plain, (red(X1)|~at(X1,here,X2))).
% 0.13/0.38 cnf(i_0_16, plain, (hand_at(X1,let_go(X2))|~hand_at(X1,X2))).
% 0.13/0.38 cnf(i_0_20, plain, (at(X1,X2,let_go(X3))|~at(X1,X2,X3))).
% 0.13/0.38 cnf(i_0_21, plain, (at(X1,X2,pick_up(X3))|~at(X1,X2,X3))).
% 0.13/0.38 cnf(i_0_17, plain, (hand_at(X1,go(X1,X2))|~hand_at(X3,X2))).
% 0.13/0.38 cnf(i_0_27, plain, (held(X1,pick_up(X2))|~hand_at(X3,X2)|~at(X1,X3,X2))).
% 0.13/0.38 cnf(i_0_26, plain, (at(X1,X2,go(X2,X3))|~held(X1,X3)|~hand_at(X4,X3))).
% 0.13/0.38 cnf(i_0_22, plain, (grabbed(X1,pick_up(go(X2,let_go(X3))))|~at(X1,X2,X3))).
% 0.13/0.38 cnf(i_0_25, plain, (held(X1,X2)|at(X1,X3,go(X4,X2))|~at(X1,X3,X2))).
% 0.13/0.38 cnf(i_0_24, plain, (put(X1,X2,go(X2,X3))|~grabbed(X1,X3)|~at(X1,X4,X3))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 5 steps
% 0.13/0.38 cnf(i_0_15, plain, (at(something,here,now)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_56, plain, (at(something,here,now)), inference(extension_rule, [i_0_22])).
% 0.13/0.38 cnf(i_0_103, plain, (grabbed(something,pick_up(go(here,let_go(now))))), inference(extension_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_134, plain, (put(something,X6,go(X6,pick_up(go(here,let_go(now)))))), inference(etableau_closure_rule, [i_0_134, ...])).
% 0.13/0.38 cnf(i_0_136, plain, (~at(something,X8,pick_up(go(here,let_go(now))))), inference(etableau_closure_rule, [i_0_136, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Child (17223) has found a proof.
% 0.19/0.38
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------